• DocumentCode
    3617953
  • Title

    Optimal tower fields for hyperelliptic curve cryptosystems

  • Author

    S. Baktir;J. Pelzl;T. Wollinger;B. Sunar;C. Paar

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Worcester Polytech. Inst., MA, USA
  • Volume
    1
  • fYear
    2004
  • fDate
    6/26/1905 12:00:00 AM
  • Firstpage
    522
  • Abstract
    Cryptographic primitives have increasingly emerged into embedded systems such as mobile phones, smart cards, and personal digital assistants. Elliptic Curve Cryptosystems (ECC) and Hyperelliptic curve cryptosystems (HECC) are the cryptosystems of choice for asymmetric data encryption in environments where processor power and storage are limited [T. Wollinger et al. (2003)]. We introduce the first cryptographic implementation of Optimal Tower Fields (OTF) [S. Baktir (2003)], [S. Baktir et al. (2004)] for HECC. Furthermore, we introduce the first implementation of HECC over an extension field of odd characteristic on an embedded processor. With our implementation, a scalar multiplication for a 160 bit group order can be performed in 44 ms on the ARM processor which is 57% faster than the best previously known implementation on the same processor. Our implementations also target a general purpose processor.
  • Keywords
    "Poles and towers","Elliptic curve cryptography","Arithmetic","Embedded system","Galois fields","Polynomials","Mobile handsets","Smart cards","Personal digital assistants","Information security"
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference on
  • Print_ISBN
    0-7803-8622-1
  • Type

    conf

  • DOI
    10.1109/ACSSC.2004.1399187
  • Filename
    1399187