• DocumentCode
    3381001
  • Title

    A modified architecture for Optimal Normal Basis multiplication based on pre-computation

  • Author

    Cupples, Richard ; Nibouche, Omar ; Bouridane, Ahmed

  • Author_Institution
    Inst. of Electron., Commun. & Inf. Technol. (ECIT), Queen´´s Univ. Belfast, Belfast
  • fYear
    2008
  • fDate
    Aug. 31 2008-Sept. 3 2008
  • Firstpage
    37
  • Lastpage
    40
  • Abstract
    In this paper, a newly modified optimal normal basis multiplier based on the Massey-Omura method is proposed. Improvements in both area and critical path delay have been achieved over the next best architecture in the literature, through the use of pre-computation. These improvements allow for the design of small, fast multipliers for the implementation of Elliptic Curve Cryptography.
  • Keywords
    cryptography; multiplying circuits; Massey-Omura method; elliptic curve cryptography; optimal normal basis multiplication; path delay; Arithmetic; Delay; Elliptic curve cryptography; Frequency; Galois fields; Hardware; Information technology; Internet; Niobium; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electronics, Circuits and Systems, 2008. ICECS 2008. 15th IEEE International Conference on
  • Conference_Location
    St. Julien´s
  • Print_ISBN
    978-1-4244-2181-7
  • Electronic_ISBN
    978-1-4244-2182-4
  • Type

    conf

  • DOI
    10.1109/ICECS.2008.4674785
  • Filename
    4674785
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3381001