Proposal of primitive polynomials for Linux kernel PRNG

David FONTAINE; Olivier VIVOLO

Paper 2017/726

Proposal of primitive polynomials for Linux kernel PRNG

David FONTAINE and Olivier VIVOLO

Abstract

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.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Preprint. MINOR revision.
Keywords: linux prng lfsr
Contact author(s): olivier vivolo @ orange com
History: 2017-07-31: received
Short URL: https://ia.cr/2017/726
License: CC BY

BibTeX

@misc{cryptoeprint:2017/726,
      author = {David FONTAINE and Olivier VIVOLO},
      title = {Proposal of primitive polynomials for Linux kernel {PRNG}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/726},
      year = {2017},
      url = {https://eprint.iacr.org/2017/726}
}