Paper 2023/1834 Original: eprint.iacr.org/2023/1834 ↗

Building a BBB Pseudorandom Permutation using Lai-Massey Networks

Ritam Bhaumik
Mohammad Amin Raeisi
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
Preprint.
History
2025-04-20: last updated
2023-11-29: published
Short URL
https://ia.cr/2023/1834
License
https://creativecommons.org/licenses/by-nc-sa/4.0/

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},
      url = {https://eprint.iacr.org/2023/1834}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.