# Pseudorandom permutation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- IACR Cryptology ePrint Archive
- 2017

A number of cryptographic schemes are built from (keyless) permutations, which are either designed in an ad-hoc fashion or areâ€¦Â (More)

Is this relevant?

2014

2014

- ASIACRYPT
- 2014

In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandomâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IACR Cryptology ePrint Archive
- 2010

This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, ofâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- 2010

Many research efforts for image encryption schemes have elaborated for designing nonlinear functions since security of theseâ€¦Â (More)

Is this relevant?

2008

2008

- IACR Cryptology ePrint Archive
- 2008

Let E be a strong pseudorandom permutation (or SPRP) secure enciphering scheme (i.e., a length-preserving encryption schemeâ€¦Â (More)

Is this relevant?

2006

2006

- FSE
- 2006

We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. Weâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- ACM Conference on Computer and Communicationsâ€¦
- 2001

We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encryptsâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Journal of Cryptology
- 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

- STOC
- 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

- ACM Conference on Computer and Communicationsâ€¦
- 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?