Welcome to the resource topic for 2002/127
Title:
Power of a Public Random Permutation and its Application to Authenticated-Encryption
Authors: 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.
ePrint: https://eprint.iacr.org/2002/127
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .