Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator

DOI10.1007/11423461_23MaRDI QIDQ5450839zbMATH OpenOpenAlexFDO

Authors Vincent Bénony, François Recher, Éric Wegrzynowski, Caroline Fontaine

Publication date 14 March 2008

Published in Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11423461_23

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1
• Progress in Cryptology – Mycrypt 2005
• On properties of the Klimov-Shamir generator of pseudorandom numbers
• Time-Memory Trade-Off Attacks on Multiplications and T-Functions
• Selected Areas in Cryptography

Cited in

(6)

• Cryptographic properties of nonlinear pseudorandom number generators
• Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1
• Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs
• On properties of the Klimov-Shamir generator of pseudorandom numbers
• New application methods for word-oriented cryptographic primitives
• Time-Memory Trade-Off Attacks on Multiplications and T-Functions

This page was built for publication: Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450839)