Pseudorandom permutation

Known as: Pseudo-random permutation 
In cryptography, the term pseudorandom permutation, abbreviated PRP, refers to a function that cannot be distinguished from a random permutation… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A number of cryptographic schemes are built from (keyless) permutations, which are either designed in an ad-hoc fashion or are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandom… (More)
  • figure 2.1
  • figure 3.1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, of… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Many research efforts for image encryption schemes have elaborated for designing nonlinear functions since security of these… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2008
2008
Let E be a strong pseudorandom permutation (or SPRP) secure enciphering scheme (i.e., a length-preserving encryption scheme… (More)
  • table 1
  • figure 1
Is this relevant?
2006
2006
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encrypts… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We suggest a scheme for a block cipher which uses only one randomly chosen permutation,F. The key, consisting of two blocks,K 1… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Luby and Racko [27] showed a method for constructing a pseudo-random permutation from a pseudo-random function. The method is… (More)
Is this relevant?
1997
1997
This paper is a continuation of the work iuitiated in [2] by M. Luby and C:. Rackoff on pseudorandoul function and permutations… (More)
Is this relevant?