How to Construct Pseudorandom Permutations from Pseudorandom Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A study of password security
- Synthesizers and their application to the parallel construction of pseudo-random functions
- A construction of a cipher from a single pseudorandom permutation.
- Non-cryptographic primitive for pseudorandom permutation.
- Pseudorandom permutation
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Anonymous IBE, leakage resilience and circular security from new assumptions
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Deterministic encryption with the Thorp shuffle
- On the optimality of non-linear computations for symmetric key primitives
- A randomness test for block ciphers
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Guaranteeing the diversity of number generators
- A construction of the simplest super pseudorandom permutation generator
- Mathematical problems in cryptology
- Pseudorandomness analysis of the (extended) Lai-Massey scheme
- Tweakable enciphering schemes using only the encryption function of a block cipher
- Implementing, and keeping in check, a DSL used in E-learning
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Three third generation attacks on the format preserving encryption scheme FF3
- Provable related-key security of contracting Feistel networks
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- The summation-truncation hybrid: reusing discarded bits for free
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- Subquadratic SNARGs in the random oracle model
- Computational hardness of optimal fair computation: beyond Minicrypt
- Optimum attack on 3-round Feistel-2 structure
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Building blockcipher from small-block tweakable blockcipher
- More efficient DDH pseudorandom generators
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Hardness-preserving reductions via cuckoo hashing
- Square reflection cryptanalysis of 5-round Feistel networks with permutations
- Practical construction and analysis of pseudo-randomness primitives
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- Pseudorandomness of Camellia-like scheme
- Extended meet-in-the-middle attacks on some Feistel constructions
- Constructing parallel long-message signcryption scheme from trapdoor permutation
- Beyond-birthday security for permutation-based Feistel networks
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Applications of Simon's algorithm in quantum attacks on Feistel variants
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Hash functions from defective ideal ciphers
- On the XOR of multiple random permutations
- Cryptanalysis of Feistel networks with secret round functions
- Breaking symmetric cryptosystems using quantum period finding
- Indifferentiability of 8-Round Feistel Networks
- Cryptography from learning parity with noise
- Towards Understanding the Known-Key Security of Block Ciphers
- Attacking BEAR and LION schemes in a realistic scenario
- Online ciphers from tweakable blockciphers
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- Security of Hash-then-CBC key wrapping revisited
- The GGM Function Family Is a Weakly One-Way Family of Functions
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
- A domain extender for the ideal cipher
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- New attacks on Feistel structures with improved memory complexities
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- A Proof of Security in O(2 n ) for the Benes Scheme
- Robust Multi-property Combiners for Hash Functions Revisited
- A Provable-Security Treatment of the Key-Wrap Problem
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Generic Attacks on Feistel Networks with Internal Permutations
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- Building Secure Block Ciphers on Generic Attacks Assumptions
- The “Coefficients H” Technique
- Sparse pseudorandom distributions
- scientific article; zbMATH DE number 177029 (Why is no real title available?)
- scientific article; zbMATH DE number 1302852 (Why is no real title available?)
- scientific article; zbMATH DE number 1304088 (Why is no real title available?)
- scientific article; zbMATH DE number 503344 (Why is no real title available?)
- On the provable security of BEAR and LION schemes
- scientific article; zbMATH DE number 697810 (Why is no real title available?)
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- Tweakable block ciphers
- scientific article; zbMATH DE number 1559534 (Why is no real title available?)
- Revisiting iterated attacks in the context of decorrelation theory
- Probably secure keyed-function based authenticated encryption schemes for big data
- Cryptanalysis of Ladder-DES
- On the security of remotely keyed encryption
- About Feistel schemes with six (or more) rounds
- Monkey: black-box symmetric ciphers designed for MON\textit{opolizing} KEY\textit{s}
- RIV for robust authenticated encryption
- An Almost m-wise Independent Random Permutation of the Cube
- Improved mixing time bounds for the Thorp shuffle
- On Integral Distinguishers of Rijndael Family of Ciphers
- Distinguishing distributions using Chernoff information
- Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
- Pseudorandom functions: three decades later
- Pseudo-mixing Time of Random Walks
- Generic attacks on the Lai-Massey scheme
- Keyed hash functions
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
This page was built for publication: How to Construct Pseudorandom Permutations from Pseudorandom Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787920)
