Probability to meet in the middle

DOI10.1007/BF02252867zbMath0701.94005OpenAlexW2055432187MaRDI QIDQ914644

Kazuo Nishimura, Masaaki Sibuya

Publication date: 1990

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

occupancyauthenticationbirthday paradoxprobability of successforgeryUrn modelsmeet-in-the-middle attacksData Encryption StandarddigestsHash functionsMatching Models

Mathematics Subject Classification ID

Cryptography (94A60) Special processes (60K99)

Related Items

Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox ⋮ Occupancy with two types of balls ⋮ Collision attacks on round-reduced SHA-3 using conditional internal differentials ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ Computation of low-weight parity checks for correlation attacks on stream ciphers ⋮ Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order ⋮ How much data may be safely processed on one key in different modes? ⋮ Analysis of 3gpp-MAC and two-key 3gpp-MAC

Cites Work

• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Occupancy with two types of balls
• DES-GENERATED CHECKSUMS FOR ELECTRONIC SIGNATURES
• Producing a One-Way Hash Function from DES
• On the Security of Compressed Encodings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item