How to Construct Pseudorandom Permutations from Pseudorandom Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Building blockcipher from small-block tweakable blockcipher
- On the provable security of BEAR and LION schemes
- Breaking symmetric cryptosystems using quantum period finding
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Private information retrieval using trusted hardware
- Non-cryptographic primitive for pseudorandom permutation.
- A study of password security
- Provable related-key security of contracting Feistel networks
- Authenticated Encryption Mode for Beyond the Birthday Bound Security
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Optimum attack on 3-round Feistel-2 structure
- Spectral distinguishing attacks on Luby-Rackoff schemes based on independent two-block texts
- CCA security for contracting (quasi-)Feistel constructions with tight round complexity
- Deterministic encryption with the Thorp shuffle
- On the optimality of non-linear computations for symmetric key primitives
- Pseudorandomness analysis of the (extended) Lai-Massey scheme
- About Feistel schemes with six (or more) rounds
- Performance improvement for the GGM-construction of pseudorandom functions
- A construction of the simplest super pseudorandom permutation generator
- Feistel ciphers based on a single primitive
- Difference characteristics of random maps and their compositions
- Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- A construction of a cipher from a single pseudorandom permutation.
- Provable security of HADES structure
- scientific article; zbMATH DE number 1559534 (Why is no real title available?)
- Tweakable Enciphering Schemes from Hash-Sum-Expansion
- Bet-or-pass: adversarially robust Bloom filters
- Feedback linearly extended discrete functions
- Towards compressed permutation oracles
- The relationship between idealized models under computationally bounded adversaries
- The security of the cipher block chaining message authentication code
- Public-seed pseudorandom permutations
- Tweakable block ciphers
- The “Coefficients H” Technique
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Keyed sum of permutations: a simpler RP-based PRF
- Tweakable Pseudorandom Permutation from Generalized Feistel Structure
- Iceberg hashing: optimizing many hash-table criteria at once
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Mathematical problems in cryptology
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Revisiting iterated attacks in the context of decorrelation theory
- Indifferentiability of 8-Round Feistel Networks
- Security of Hash-then-CBC key wrapping revisited
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- Robust multi-property combiners for hash functions
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Post-quantum security of key-alternating Feistel ciphers
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method
- On Lai-Massey and quasi-Feistel ciphers
- New attacks on Feistel structures with improved memory complexities
- Cryptanalysis of Feistel networks with secret round functions
- Implementing, and keeping in check, a DSL used in E-learning
- Building Secure Block Ciphers on Generic Attacks Assumptions
- Towards minimizing tweakable blockcipher-based generalized Feistel networks
- Cryptanalysis of Ladder-DES
- Probably secure keyed-function based authenticated encryption schemes for big data
- Pseudo-mixing Time of Random Walks
- Pseudorandom functions: three decades later
- Keyed hash functions
- Analysis of the single-permutation encrypted Davies-Meyer construction
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)
