Paper 2023/1834
Building a BBB Pseudorandom Permutation using Lai-Massey Networks
Abstract
In spite of being a popular technique for designing block ciphers, Lai-Massey networks have received considerably less attention from a security analysis point of view than Feistel networks and Substitution-Permutation networks. In this paper we study the beyond-birthday-bound (BBB) security of Lai-Massey networks with independent random round functions against chosen-plaintext adversaries. Concretely, we show that five rounds are necessary and sufficient to achieve BBB security.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published by the IACR in CIC 2024
- DOI
- 10.62056/a0wahey6b
- Keywords
- Beyond-Birthday-BoundLai-MasseyProvable Indistinguishability
- Contact author(s)
-
ritam bhaumik @ epfl ch
m aminra81 @ gmail com - History
- 2025-04-20: last of 3 revisions
- 2023-11-29: received
- See all versions
- Short URL
- https://ia.cr/2023/1834
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2023/1834,
author = {Ritam Bhaumik and Mohammad Amin Raeisi},
title = {Building a {BBB} Pseudorandom Permutation using Lai-Massey Networks},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1834},
year = {2023},
doi = {10.62056/a0wahey6b},
url = {https://eprint.iacr.org/2023/1834}
}