Abstract: In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the cryptanalysis algorithm.
Recommendations
- scientific article; zbMATH DE number 897206
- scientific article; zbMATH DE number 934075
- scientific article; zbMATH DE number 503240
- Experimental study of the efficiency of generators of pseudo-random numbers based on the RC5 and RC6 cryptographic algorithms
- Generating and testing cryptographically secure random numbers
Cites work
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- A First Look at Rigorous Probability Theory
- Decrypting classical cipher text using Markov chain Monte Carlo
- Handbook of Markov Chain Monte Carlo
- Some long-period random number generators using shifts and xors
- Uniform random number generation
Cited in
(6)- A first study of improving transposition cryptosystem
- Improved cryptanalysis of the AJPS Mersenne based cryptosystem
- An improvement of pseudorandomization against unbounded attack algorithms -- the case of fingerprint codes
- An improvement of SPLICE/AS in WIDE against guessing attack
- Improved domain extender for the ideal cipher
- An improved binary algorithm for RSA
This page was built for publication: An improvement of a cryptanalysis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894480)
