Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / block ciphers

Date: received 26 Aug 2002, last revised 14 Oct 2008

Contact author: kurosawa at mx ibaraki ac jp

Available format(s): PDF | BibTeX Citation

Note: Sec.2.2 is revised.

Version: 20081015:005738 (All versions of this report)

Short URL: ia.cr/2002/127

Discussion forum: Show discussion | Start new discussion