Share Email Print

Proceedings Paper

Pseudo-random generator based on Chinese Remainder Theorem
Author(s): Jean Claude Bajard; Heinrich Hördegen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Pseudo-Random Generators (PRG) are fundamental in cryptography. Their use occurs at different level in cipher protocols. They need to verify some properties for being qualified as robust. The NIST proposes some criteria and a tests suite which gives informations on the behavior of the PRG. In this work, we present a PRG constructed from the conversion between further residue systems of representation of the elements of GF(2)[X]. In this approach, we use some pairs of co-prime polynomials of degree k and a state vector of 2k bits. The algebraic properties are broken by using different independent pairs during the process. Since this method is reversible, we also can use it as a symmetric crypto-system. We evaluate the cost of a such system, taking into account that some operations are commonly implemented on crypto-processors. We give the results of the different NIST Tests and we explain this choice compare to others found in the literature. We describe the behavior of this PRG and explain how the different rounds are chained for ensuring a fine secure randomness.

Paper Details

Date Published: 3 September 2009
PDF: 8 pages
Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440Q (3 September 2009); doi: 10.1117/12.827023
Show Author Affiliations
Jean Claude Bajard, LIRMM, CNRS, Univ. Montpellier 2 (France)
Heinrich Hördegen, LIRMM, CNRS, Univ. Montpellier 2 (France)

Published in SPIE Proceedings Vol. 7444:
Mathematics for Signal and Information Processing
Franklin T. Luk; Mark S. Schmalz; Gerhard X. Ritter; Junior Barrera; Jaakko T. Astola, Editor(s)

© SPIE. Terms of Use
Back to Top