Abstract
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.
This research was supported in part by the National Swedish Board for Technical Development under grant 81-3323 at the University of Lund.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herlestam, T. (1983). On Using Prime Polynomials in Crypto Generators. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-39466-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11993-7
Online ISBN: 978-3-540-39466-2
eBook Packages: Springer Book Archive