[Resource Topic] 2017/726: Proposal of primitive polynomials for Linux kernel PRNG

Welcome to the resource topic for 2017/726

Proposal of primitive polynomials for Linux kernel PRNG

Authors: David FONTAINE, Olivier VIVOLO


The polynomials defining the LFSRs of the linux Kernel PRNG are irreducible but not primitive. As a result, the space of numbers generated by these LFSRs does not fill all the space. We propose in this paper more optimal polynomials which increase by a factor of 3 the space of the random numbers generated by these LFSRs. The polynomials used in the current implementation of the PRNG and the point presented here, do not conclude a practical attack on the PRNG.

ePrint: https://eprint.iacr.org/2017/726

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .