• DocumentCode
    1557369
  • Title

    A search of minimal key functions for normal basis multipliers

  • Author

    Lu, Chung-Chin

  • Author_Institution
    Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
  • Volume
    46
  • Issue
    5
  • fYear
    1997
  • fDate
    5/1/1997 12:00:00 AM
  • Firstpage
    588
  • Lastpage
    592
  • Abstract
    The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2m) depends on the key function for multiplication. Key functions with minimum complexity, called minimal key functions, are desirable. This paper investigates the complexity of a key function and reports search results of minimal key functions. A table of minimal key functions for m up to 31 is included
  • Keywords
    cryptography; digital arithmetic; logic design; Massey-Omura normal basis multiplier; circuit complexity; coding; cryptography; finite field; minimal key functions; multiplier; normal basis; normal basis multipliers; Arithmetic; Circuits; Codecs; Complexity theory; Cryptography; Galois fields; Programmable logic arrays; Propagation delay; Shift registers; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.589230
  • Filename
    589230
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1557369