• DocumentCode
    861356
  • Title

    Simple multiplication algorithm for a class of GF(2n)

  • Author

    Haining, Fan

  • Author_Institution
    Dept. of Comput. Sci., Inst. of Commun. Eng., Nanjing, China
  • Volume
    32
  • Issue
    7
  • fYear
    1996
  • fDate
    3/28/1996 12:00:00 AM
  • Firstpage
    636
  • Lastpage
    637
  • Abstract
    It is shown that if 2 is a primitive root mod prime n+1 and GF(2 n) is generated by an irreducible all one polynomial (AOP) then a simple multiplication algorithm exists over the field GF(2n )
  • Keywords
    combinatorial mathematics; digital arithmetic; number theory; polynomials; GF(2n) field; multiplication algorithm; polynomial; primitive root mod prime;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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