Paper 2015/414
On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
Mridul Nandi
Abstract
It is well known that three and four rounds of balanced Feistel cipher or Luby-Rackoff (LR) encryption for two blocks messages are pseudorandom permutation (PRP) and strong pseudorandom permutation (SPRP) respectively. A {\bf block} is
Note: A small changes in the SPRP distinguisher has been done as pointed out by Lear Bahack in the crypto-competition google forum.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- XLSCMCLuby-RackoffPRPSPRPBlockcipher.
- Contact author(s)
- mridul nandi @ gmail com
- History
- 2015-05-27: last of 2 revisions
- 2015-05-05: received
- See all versions
- Short URL
- https://ia.cr/2015/414
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/414, author = {Mridul Nandi}, title = {On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/414}, year = {2015}, url = {https://eprint.iacr.org/2015/414} }