Paper 2022/818
Provably Secure Reflection Ciphers
Abstract
This paper provides the first analysis of reflection ciphers such as PRINCE from a provable security viewpoint.
As a first contribution, we initiate the study of key-alternating reflection ciphers in the ideal permutation model. Specifically, we prove the security of the two-round case and give matching attacks. The resulting security bound takes form
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published by the IACR in CRYPTO 2022
- Keywords
- Reflection ciphers Public random permutations Ideal cipher model Sum capture theorem PRINCE
- Contact author(s)
-
tim beyne @ esat kuleuven be
yulong chen @ kuleuven be - History
- 2022-06-23: approved
- 2022-06-22: received
- See all versions
- Short URL
- https://ia.cr/2022/818
- License
-
CC0
BibTeX
@misc{cryptoeprint:2022/818, author = {Tim Beyne and Yu Long Chen}, title = {Provably Secure Reflection Ciphers}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/818}, year = {2022}, url = {https://eprint.iacr.org/2022/818} }