Non-cryptographic primitive for pseudorandom permutation.
From MaRDI portal
Recommendations
- Non-cryptographic primitive for pseudorandom permutation
- scientific article; zbMATH DE number 697812
- A construction of the simplest super pseudorandom permutation generator
- How to re-use round function in super-pseudorandom permutation
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
Cites work
- Faster Luby-Rackoff ciphers
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- New block encryption algorithm MISTY
- New hash functions and their use in authentication and set equality
- New results on the pseudorandomness of some blockcipher constructions
- New structure of block ciphers with provable security against differential and linear cryptanalysis
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- On the round security of symmetric-key cryptographic primitives
- Round security and super-pseudorandomness of MISTY type structure
- Universal classes of hash functions
Cited in
(5)- A construction of the simplest super pseudorandom permutation generator
- Non-cryptographic primitive for pseudorandom permutation
- Round security and super-pseudorandomness of MISTY type structure
- scientific article; zbMATH DE number 697812 (Why is no real title available?)
- How to re-use round function in super-pseudorandom permutation
This page was built for publication: Non-cryptographic primitive for pseudorandom permutation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426446)