• DocumentCode
    2536183
  • Title

    Design and implementation of arithmetic processor F2155 for elliptic curve cryptosystems

  • Author

    Sutikno, Sarwono ; Effendi, Ronny ; Surya, Andy

  • Author_Institution
    Integrated Syst. Lab., Bandung Inst. of Technol., Indonesia
  • fYear
    1998
  • fDate
    24-27 Nov 1998
  • Firstpage
    647
  • Lastpage
    650
  • Abstract
    Since Diffie and Hellman first introduced the concept of public key cryptography in 1976, the potential usage of discrete logarithm problems in public key cryptosystems has been recognized. Then, in 1985, ElGamal proposed a public key cryptosystem scheme based on this problem. Elliptic curve cryptosystems is a cryptosystem that is based on discrete logarithm problems but using the elliptic curve group so it is more difficult than the discrete logarithm problem itself. In this paper we will describe how to design and implement an arithmetic processor with an efficient architecture and apply it to the elliptic curve cryptosystem
  • Keywords
    digital arithmetic; public key cryptography; arithmetic processor; discrete logarithm problems; elliptic curve cryptosystems; public key cryptography; Arithmetic; Clocks; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; H infinity control; Hardware; Pediatrics; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1998. IEEE APCCAS 1998. The 1998 IEEE Asia-Pacific Conference on
  • Conference_Location
    Chiangmai
  • Print_ISBN
    0-7803-5146-0
  • Type

    conf

  • DOI
    10.1109/APCCAS.1998.743903
  • Filename
    743903