• DocumentCode
    1354232
  • Title

    Squaring architecture for GF(2m) and its applications in cryptographic systems

  • Author

    Orlando, G. ; Paar, C.

  • Author_Institution
    Dept. of Electr. Comput. Eng., Worcester Polytech. Inst., MA, USA
  • Volume
    36
  • Issue
    13
  • fYear
    2000
  • fDate
    6/22/2000 12:00:00 AM
  • Firstpage
    1116
  • Lastpage
    1117
  • Abstract
    A squaring architecture for standard basis field representation is presented. The architecture is based on the observation that a squaring operation in GF(2m) can be transformed into an addition and a multiplication of two elements of special form, the computational time of which depends on the form of the field polynomial
  • Keywords
    cryptography; multiplying circuits; polynomials; GF(2m); addition; computational time; cryptographic systems; field polynomial; multiplication; squaring architecture; standard basis field representation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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