Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Real Time Cryptanalysis of A5/1 on a PC
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Applied Cryptanalysis: Breaking Ciphers in the Real World
Applied Cryptanalysis: Breaking Ciphers in the Real World
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Cryptanalysis of alleged A5 stream cipher
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Variants of the distinguished point method for cryptanalytic time memory trade-offs
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Time-Memory trade-offs: false alarm detection using checkpoints
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Rigorous bounds on cryptanalytic time/memory tradeoffs
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
A cryptanalytic time-memory trade-off
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
The classical Hellman@?s cryptanalytic time-memory trade-off method and its later enhancements notoriously suffer from false alarm phenomena, which are the consequence of multiple occurrences of keys in Hellman chains. These detrimental situations can be avoided if the record of the keys already included into chains is kept during the generation of chains in the precomputation phase which guarantees perfect chains without key repetitions. The paper presents the theoretical and practical analysis that determines relevant characteristics of the perfect chains such as the probabilities that a chain will be of a certain length, the number of chains, their average lengths, as well as the coverage of the key space. In order to obtain these indicators, a detailed probabilistic analytical model is developed which treats the chain generation as a random process. The close matching of the model outputs to the numerical results obtained by the simulation experiments for different sizes of the key space proved the validity of the model. The numerical results are discussed in detail and the conclusions are finally drawn.