Cryptography Stack Exchange
Cryptography Stack Exchange

Questions tagged [pseudo-random-permutation]

A Pseudo-Random Permutation (PRP) is a function that cannot be distinguished (with practical effort) from a permutation selected at random with uniform probability from the family of all permutations on the function's domain.

A Pseudo-Random Permutation (PRP) is a function that cannot be distinguished (with practical effort) from a permutation selected at random with uniform probability from the family of all permutations on the function's domain.

Wikipedia: http://en.wikipedia.org/wiki/Pseudo-random_permutation

182 questions
2
votes
0 answers

Examples of one-way pseudo-random permutation?

One-way functions have many candidates such as integer factorization. I am interested in combinatorial one way permutations. Specifically, I am interested in known one-way pseudo-random permutations (ideally a survey paper).
Mohammad Al-Turkistany
  • 253
  • 2
  • 9
1
vote
2 answers

Is there a Pseudo Random Permutation Generator that can output all values of the length of N

Is there a pseudo random permutation generator that produces all permutation of any bit length of the plaintext (this may not be clear, please let me know and I will explain). It must be fast, and does not hold numbers in memory. This is a…
Jonathan Hutton
  • 29
  • 1
  • 7
1
vote
1 answer

How to pick up random number within range using pseudo-random number sequence

I want to generate PRP using Fisher–Yates shuffle for array [1,2,3,4,5,6,7,8,9,10,11,12]. I implemented NLFSR_25bit with specific seed for PRNG. (for picking up pseudo-random number in every iteration of algorithm ) Fisher–Yates takes…
Captain
  • 21
  • 3
1
vote
0 answers

Cross, Benes and Butterfly permutation. How make it?

I'm not a math professional and researching an algorithm to provide a good permutation, I found references for Butterfly, Benes and Cross permutations. But all papers I found are in fact discussing some enhancements and/or CPU mnemonics to these…
David BS
  • 197
  • 2
  • 6
0
votes
0 answers

Pseudorandom permutations

So I am trying to solve some exercises about pseudorandom permutations. Assume that keyed-permuation $E_k(x)$ is a pseudorandom permutation, where $|x|=|k|=n$. Using $E_k(x)$, we construct an encryption sheme as follows. $$ c=m\oplus…
pepsilon
  • 1
0
votes
0 answers

Is there a constant-overhead PRP construction based on PRPs for large inputs?

Somewhat recently I learned that there's a separation between an encryption scheme being CCA2 secure and being AE secure, namely PRPs. So if we would use AES as an encryption scheme for fixed-size messages it would be CCA2 secure but not AE secure…
SEJPM
  • 45,967
  • 7
  • 99
  • 205