Paper 2002/127
Power of a Public Random Permutation and its Application to Authenticated-Encryption
Kaoru Kurosawa
Abstract
In this paper, we first show that many independent pseudorandom permutations over $\{0,1\}^n$ can be obtained from a single public random permutation and secret $n$ bits. We next prove that a slightly modified IAPM is secure even if the underlying block cipher $F$ is publicly accessible (as a blackbox). We derive a similar result for OCB mode, too. We finally prove that our security bound is tight within a constant factor.
Note: Sec.2.2 is revised.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- block ciphers
- Contact author(s)
- kurosawa @ mx ibaraki ac jp
- History
- 2008-10-15: last of 2 revisions
- 2002-08-26: received
- See all versions
- Short URL
- https://ia.cr/2002/127
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/127,
author = {Kaoru Kurosawa},
title = {Power of a Public Random Permutation and its Application to Authenticated-Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/127},
year = {2002},
url = {https://eprint.iacr.org/2002/127}
}