• DocumentCode
    1352784
  • Title

    Algorithm for recursively generating irreducible polynomials

  • Author

    Wang, M.Z.

  • Author_Institution
    Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong
  • Volume
    32
  • Issue
    20
  • fYear
    1996
  • fDate
    9/26/1996 12:00:00 AM
  • Firstpage
    1875
  • Abstract
    A simple method for checking the irreducibility of f(x2+x+1) and f(x2+x) over GF(2) is described. An algorithm that recursively generates irreducible polynomials is presented. These irreducible polynomials are useful in constructing finite fields for applications in error-correcting codes and cryptography
  • Keywords
    Galois fields; cryptography; error correction codes; polynomials; cryptography; error-correcting codes; finite fields; irreducible polynomials; recursive generation algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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