Pseudo-Random Generator Based on Chinese Remainder Theorem

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.
Type de document :
Communication dans un congrès
SPIE 2009, Advanced Signal Processing Algorithms, Architectures, and Implementations XIX, Aug 2009, San-Diego, United States. 7444B, pp.8, 2009, Proceedings of SPIE
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00416194
Contributeur : Jean Claude Bajard <>
Soumis le : dimanche 13 septembre 2009 - 09:40:33
Dernière modification le : jeudi 24 mai 2018 - 15:59:21

Identifiants

  • HAL Id : lirmm-00416194, version 1

Collections

Citation

Jean-Claude Bajard, Heinrich Hördegen. Pseudo-Random Generator Based on Chinese Remainder Theorem. SPIE 2009, Advanced Signal Processing Algorithms, Architectures, and Implementations XIX, Aug 2009, San-Diego, United States. 7444B, pp.8, 2009, Proceedings of SPIE. 〈lirmm-00416194〉

Partager

Métriques

Consultations de la notice

98