EUROCRYPT 1982: Cryptography pp 207-216 | Cite as

On Using Prime Polynomials in Crypto Generators

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 149)


In this note a primality test for polynomials over a finite field is analyzed. It is particularly well suited to achieve fast computations in the binary case. Lots of prime polynomials which do not have to possess the maximum length property can be easily accessed by means of the test.

Examples of binary prime polynomials generated through the use of the test are given for degrees from 35 up to 55.

The computational requirements are compared with a related test for maximum length and also with some common factorization procedures. As main application the use of prime polynomials in certain crypto generators is considered.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  1. 1.Department of Computer EngineeringUniversity of LundLundSweden

Personalised recommendations