How to Construct Pseudorandom Permutations from Pseudorandom Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A randomness test for block ciphers
- Cryptography from learning parity with noise
- scientific article; zbMATH DE number 697810 (Why is no real title available?)
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
- Obfustopia built on secret-key functional encryption
- Breaking RSA generically is equivalent to factoring, with preprocessing
- Are your keys protected? Time will tell
- Full-phase distributed quantum differential cryptanalysis and its variants on block ciphers
- Pseudorandomness of Camellia-like scheme
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Distinguishing distributions using Chernoff information
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Unbiasable verifiable random functions
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- Generic Attacks on Feistel Networks with Internal Permutations
- Hardness-preserving reductions via cuckoo hashing
- A Proof of Security in O(2 n ) for the Benes Scheme
- Improved mixing time bounds for the Thorp shuffle
- Toward an easy-to-understand structure for achieving chosen ciphertext security from the decisional Diffie-Hellman assumption
- On the XOR of multiple random permutations
- Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
- The GGM Function Family Is a Weakly One-Way Family of Functions
- Characteristics of distinguishing attacks on 3 and 4 rounds of the Luby-Rackoff scheme in independent permutations model
- A domain extender for the ideal cipher
- Hard quantum extrapolations in quantum cryptography
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- On Integral Distinguishers of Rijndael Family of Ciphers
- Extended meet-in-the-middle attacks on some Feistel constructions
- Practical construction and analysis of pseudo-randomness primitives
- Beyond-birthday security for permutation-based Feistel networks
- Distinguishing attack on four rounds of the Luby-Rackoff cipher by differentials of two-block texts
- Matrix of transition probabilities of differentials of 8-round Luby-Rackoff scheme
- Three third generation attacks on the format preserving encryption scheme FF3
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Applications of Simon's algorithm in quantum attacks on Feistel variants
- Two ways of calculating of differential transition probabilities in Luby-Rackoff scheme
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- More efficient DDH pseudorandom generators
- RIV for robust authenticated encryption
- Indifferentiability of 3-round confusion-diffusion networks
- Mystrium: wide block encryption efficient on entry-level processors
- Distinguishing properties and applications of higher order derivatives of Boolean functions
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Pseudorandom permutation
- Sparse pseudorandom distributions
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- A new structural-differential property of 5-round AES
- scientific article; zbMATH DE number 177029 (Why is no real title available?)
- On the security of remotely keyed encryption
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- The summation-truncation hybrid: reusing discarded bits for free
- On the sequential indifferentiability of the Lai-Massey construction
- Constructing parallel long-message signcryption scheme from trapdoor permutation
- Generic attacks on the Lai-Massey scheme
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- MKV: a new block cipher for the post-quantum cryptography transition
- Related-key analysis of generalized Feistel networks with expanding round functions
- Generic attacks with standard deviation analysis on a-Feistel schemes
- Monkey: black-box symmetric ciphers designed for MON\textit{opolizing} KEY\textit{s}
- Luby-Rackoff backwards with more users and more security
- Real-valued somewhat-pseudorandom unitaries
- UFLM: a unified framework for Feistel structure and Lai-Massey structure
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- Guaranteeing the diversity of number generators
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- Post-quantum security on the Lai-Massey scheme
- Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
- Jammin' on the deck
- An Almost m-wise Independent Random Permutation of the Cube
- Populating the zoo of rugged pseudorandom permutations
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- A Provable-Security Treatment of the Key-Wrap Problem
- Robust Multi-property Combiners for Hash Functions Revisited
- Classical and quantum generic attacks on 6-round Feistel schemes
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Notions and relations for RKA-secure permutation and function families
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Quantum attacks on Lai-Massey structure
- Computational hardness of optimal fair computation: beyond Minicrypt
- Attacking BEAR and LION schemes in a realistic scenario
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Square reflection cryptanalysis of 5-round Feistel networks with permutations
- Tweakable enciphering schemes using only the encryption function of a block cipher
- Hash functions from defective ideal ciphers
- A general mixing strategy for the ECB-Mix-ECB mode of operation
- Subquadratic SNARGs in the random oracle model
- Quantum attacks: a view of data complexity on offline Simon's algorithm
- Towards Understanding the Known-Key Security of Block Ciphers
- BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
- Noise-free thumbnail-preserving image encryption based on MSB prediction
- New attacks on Feistel structures with improved memory complexities
- Online ciphers from tweakable blockciphers
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)
