Pages that link to "Item:Q3787920"
From MaRDI portal
The following pages link to How to Construct Pseudorandom Permutations from Pseudorandom Functions (Q3787920):
Displaying 50 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method (Q329196) (← links)
- On the provable security of BEAR and LION schemes (Q429778) (← links)
- Tweakable block ciphers (Q451118) (← links)
- Revisiting iterated attacks in the context of decorrelation theory (Q458736) (← links)
- Generic attacks on the Lai-Massey scheme (Q522214) (← links)
- Notions and relations for RKA-secure permutation and function families (Q540472) (← links)
- On Lai-Massey and quasi-Feistel ciphers (Q629883) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Generic attacks with standard deviation analysis on a-Feistel schemes (Q680923) (← links)
- Distinguishing properties and applications of higher order derivatives of Boolean functions (Q726339) (← links)
- Robust multi-property combiners for hash functions (Q744343) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- Related-key analysis of generalized Feistel networks with expanding round functions (Q826269) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- A general mixing strategy for the ECB-Mix-ECB mode of operation (Q975544) (← links)
- A study of password security (Q1121243) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- A construction of a cipher from a single pseudorandom permutation. (Q1364898) (← links)
- Non-cryptographic primitive for pseudorandom permutation. (Q1426446) (← links)
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (Q1749791) (← links)
- Deterministic encryption with the Thorp shuffle (Q1753170) (← links)
- On the optimality of non-linear computations for symmetric key primitives (Q1755961) (← links)
- A randomness test for block ciphers (Q1763248) (← links)
- Analysis of the single-permutation encrypted Davies-Meyer construction (Q1801088) (← links)
- Guaranteeing the diversity of number generators (Q1854489) (← links)
- A construction of the simplest super pseudorandom permutation generator (Q1894949) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Pseudorandomness analysis of the (extended) Lai-Massey scheme (Q1944043) (← links)
- Tweakable enciphering schemes using only the encryption function of a block cipher (Q1944173) (← links)
- Implementing, and keeping in check, a DSL used in E-learning (Q2039947) (← links)
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 (Q2055608) (← links)
- Three third generation attacks on the format preserving encryption scheme FF3 (Q2056726) (← links)
- Provable related-key security of contracting Feistel networks (Q2057179) (← links)
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers (Q2092793) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys (Q2101200) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Optimum attack on 3-round Feistel-2 structure (Q2128756) (← links)
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings (Q2152039) (← links)
- Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 (Q2179408) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Building blockcipher from small-block tweakable blockcipher (Q2260794) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- Using Bernstein-Vazirani algorithm to attack block ciphers (Q2414939) (← links)
