• DocumentCode
    776151
  • Title

    Fast exponentiation in subgroups of finite fields

  • Author

    Park, Y.-H. ; Jeong, S. ; Lim, J.

  • Author_Institution
    Dept. of Inf. Security & Syst. Eng., Sejong Cyber Univ., Seoul, South Korea
  • Volume
    38
  • Issue
    13
  • fYear
    2002
  • fDate
    6/20/2002 12:00:00 AM
  • Firstpage
    629
  • Lastpage
    630
  • Abstract
    A new method for fast exponentiation is introduced by adapting the work of Gallant, Lambert and Vanstone (see Advances in Cryptology-Crypto 2001 LNCS 2139, p.190-200 Springer-Verlag, 2001) to finite fields: thus, it is applicable to the multiplicative subgroups of non-prime fields with efficient group homomorphisms such as pth powering maps. When applied to a quartic extension of a 256 bit prime field, the proposed method runs up to 60% faster than ordinary exponentiation in a 1024 bit prime field
  • Keywords
    Galois fields; group theory; public key cryptography; 256 bit prime field; fast exponentiation; finite fields; group homomorphisms; multiplicative subgroups; nonprime fields; pth powering maps; public key system; quartic extension;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20020449
  • Filename
    1015723
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=776151