CryptoDB
Power of a Public Random Permutation and its Application to Authenticated-Encryption
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2002-11650, title={Power of a Public Random Permutation and its Application to Authenticated-Encryption}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / block ciphers}, url={http://eprint.iacr.org/2002/127}, note={ kurosawa@cis.ibaraki.ac.jp 11925 received 26 Aug 2002}, author={Kaoru Kurosawa}, year=2002 }