Non-cryptographic primitive for pseudorandom permutation.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1759791 (Why is no real title available?)
- Faster Luby-Rackoff ciphers
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- New Results on the Pseudorandomness of Some Blockcipher Constructions
- New block encryption algorithm MISTY
- New hash functions and their use in authentication and set equality
- New structure of block ciphers with provable security against differential and linear cryptanalysis
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Round Security and Super-Pseudorandomness of MISTY Type Structure
- Universal classes of hash functions
Cited in
(5)- Round Security and Super-Pseudorandomness of MISTY Type Structure
- Information Security and Privacy
- A construction of the simplest super pseudorandom permutation generator
- scientific article; zbMATH DE number 2089134 (Why is no real title available?)
- scientific article; zbMATH DE number 697812 (Why is no real title available?)
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)