The following publications are possibly variants of this publication:
- Limited-Birthday Distinguishers for Hash Functions - Collisions beyond the Birthday Bound Can Be MeaningfulMitsugu Iwamoto, Thomas Peyrin, Yu Sasaki. asiacrypt 2013: 504-523 [doi]
- Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday DistinguishersAkinori Hosoyamada, María Naya-Plasencia, Yu Sasaki. tosc, 2020(4):147-172, 2020. [doi]
- Improved Attacks on sLiSCP Permutation and Tight Bound of Limited Birthday DistinguishersAkinori Hosoyamada, María Naya-Plasencia, Yu Sasaki. iacr, 2020:1089, 2020. [doi]
- Multiple Limited-Birthday Distinguishers and ApplicationsJérémy Jean, María Naya-Plasencia, Thomas Peyrin. sacrypt 2014: 533-550 [doi]
- Multiple Limited-Birthday Distinguishers and ApplicationsJérémy Jean, María Naya-Plasencia, Thomas Peyrin. iacr, 2013:521, 2013. [doi]
- Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probability than Birthday BoundAkinori Hosoyamada, Yu Sasaki. eurocrypt 2020: 249-279 [doi]
- Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probability than Birthday BoundAkinori Hosoyamada, Yu Sasaki. iacr, 2020:213, 2020. [doi]