How easy is collision search? Application to DES
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
HAKMEM
New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
Fast Software Encryption
Speeding Up the Pollard Rho Method on Prime Fields
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Improved Generic Algorithms for 3-Collisions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Modeling parametric web arc weight measurement
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
On the security of blockwise secure modes of operation beyond the birthday bound
IEEE Transactions on Information Theory
Optimal covering codes for finding near-collisions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Generating a rehandling-free intra-block remarshaling plan for an automated container yard
Journal of Intelligent Manufacturing
Planning for intra-block remarshalling in a container terminal
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Hierarchical web structuring from the web as a graph approach with repetitive cycle proof
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Memoryless near-collisions via coding theory
Designs, Codes and Cryptography
International Journal of Applied Cryptography
International Journal of Applied Cryptography
Cryptography and Security
Minimalism in cryptography: the even-mansour scheme revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Memoryless near-collisions, revisited
Information Processing Letters
| Hi-index | 0.95 |
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.