Cryptology ePrint Archive: Report 2017/726

Proposal of primitive polynomials for Linux kernel PRNG


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.

Category / Keywords: applications / linux prng lfsr

Date: received 25 Jul 2017

Contact author: olivier vivolo at orange com

Available format(s): PDF | BibTeX Citation

Version: 20170731:154627 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]