Welcome to the resource topic for 2005/135
Title:
Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model
Authors: Jacques Patarin, Paul Camion
Abstract:In this paper we will extend the Benes and Luby-Rackoff
constructions to design various pseudo-random functions and
pseudo-random permutations with near optimal information-theoretic
properties. An example of application is when Alice wants to
transmit to Bob some messages against Charlie, an adversary with
unlimited computing power, when Charlie can receive only a
percentage \tau of the transmitted bits. By using Benes,
Luby-Rackoff iterations, concatenations and fixing at 0 some
values, we will show in this paper how to design near optimal
pseudo-random functions for all values of \tau. Moreover we will
show how to design near optimal pseudo-random permutations when
\tau can have any value such that the number of bits obtained by
Charlie is smaller than the square root of all the transmitted
bits.
ePrint: https://eprint.iacr.org/2005/135
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 .