Title :
Algorithm for recursively generating irreducible polynomials
Author_Institution :
Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong
fDate :
9/26/1996 12:00:00 AM
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19961259
