• DocumentCode
    1260892
  • Title

    On the inherent space complexity of fast parallel multipliers for GF(2m)

  • Author

    Elia, Michele ; Leone, Manuel

  • Author_Institution
    Dipt. di Elettronica, Politernico di Torino, Italy
  • Volume
    51
  • Issue
    3
  • fYear
    2002
  • fDate
    3/1/2002 12:00:00 AM
  • Firstpage
    346
  • Lastpage
    351
  • Abstract
    A lower bound to the number of AND gates used in parallel multipliers for GF(2m), under the condition that time complexity be minimum, is determined. In particular, the exact minimum number of AND gates for primitive normal bases and optimal normal bases of Type II multipliers is evaluated. This result indirectly suggests that space complexity is essentially a quadratic function of m when time complexity is kept minimum
  • Keywords
    computational complexity; logic gates; multiplying circuits; AND gates; Type II multipliers; exact minimum number; fast parallel multipliers; finite fields; inherent space complexity; lower bound; optimal normal bases; primitive normal bases; quadratic function; space complexity; time complexity;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.990131
  • Filename
    990131
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1260892