• DocumentCode
    1090892
  • Title

    Fast algorithms for computing the powers of a primitive element in GF(q2)

  • Author

    Nakamura, Tohgo

  • Author_Institution
    Japan Defence Agency, Tokyo, Japan
  • Volume
    26
  • Issue
    4
  • fYear
    1978
  • fDate
    8/1/1978 12:00:00 AM
  • Firstpage
    376
  • Lastpage
    378
  • Abstract
    In this correspondence a new algorithm for computing efficiently multiplications by powers of a primitive element in the finite field GF(q2), where q is a Mersenne prime, is described. This algorithm is applicable to transforms over GF(q2) which is used to implement fast circular convolutions without roundoff error.
  • Keywords
    Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Fourier transforms; Galois fields; Research and development; Roundoff errors;
  • fLanguage
    English
  • Journal_Title
    Acoustics, Speech and Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/TASSP.1978.1163098
  • Filename
    1163098
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1090892