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.
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- Square reflection cryptanalysis of 5-round Feistel networks with permutations (Q2445261) (← links)
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme (Q2491299) (← links)
- Pseudorandomness of Camellia-like scheme (Q2508379) (← links)
- Extended meet-in-the-middle attacks on some Feistel constructions (Q2630716) (← links)
- Constructing parallel long-message signcryption scheme from trapdoor permutation (Q2644418) (← links)
- Beyond-birthday security for permutation-based Feistel networks (Q2657129) (← links)
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm (Q2685637) (← links)
- Applications of Simon's algorithm in quantum attacks on Feistel variants (Q2687219) (← links)
- Hash Functions from Defective Ideal Ciphers (Q2790047) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← links)
- Cryptanalysis of Feistel Networks with Secret Round Functions (Q2807198) (← links)
- Breaking Symmetric Cryptosystems Using Quantum Period Finding (Q2829216) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Towards Understanding the Known-Key Security of Block Ciphers (Q2946886) (← links)
- Attacking BEAR and LION Schemes in a Realistic Scenario (Q2947159) (← links)
- Online Ciphers from Tweakable Blockciphers (Q3073710) (← links)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal (Q3104710) (← links)
- Security of Hash-then-CBC Key Wrapping Revisited (Q3104712) (← links)
- The GGM Function Family Is a Weakly One-Way Family of Functions (Q3179353) (← links)
- A Domain Extender for the Ideal Cipher (Q3408200) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure (Q3457107) (← links)
- New Attacks on Feistel Structures with Improved Memory Complexities (Q3457122) (← links)
- Authenticated Encryption Mode for Beyond the Birthday Bound Security (Q3506375) (← links)
- A Proof of Security in O(2 n ) for the Benes Scheme (Q3506381) (← links)
- Robust Multi-property Combiners for Hash Functions Revisited (Q3519540) (← links)
- A Provable-Security Treatment of the Key-Wrap Problem (Q3593107) (← links)
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption (Q3600382) (← links)
- Verifiable Random Functions from Identity-Based Key Encapsulation (Q3627457) (← links)
- Generic Attacks on Feistel Networks with Internal Permutations (Q3637131) (← links)
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks (Q3637132) (← links)
- Building Secure Block Ciphers on Generic Attacks Assumptions (Q3644193) (← links)
- The “Coefficients H” Technique (Q3644210) (← links)
- Sparse pseudorandom distributions (Q3990219) (← links)
- Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data (Q4605645) (← links)
- Cryptanalysis of Ladder-DES (Q4639335) (← links)
- On the security of remotely keyed encryption (Q4639343) (← links)
- About Feistel Schemes with Six (or More) Rounds (Q4639444) (← links)
- Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs (Q4639445) (← links)
- RIV for Robust Authenticated Encryption (Q4639469) (← links)
- An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
- Improved Mixing Time Bounds for the Thorp Shuffle (Q4903266) (← links)
- On Integral Distinguishers of Rijndael Family of Ciphers (Q4912029) (← links)
- Distinguishing Distributions Using Chernoff Information (Q4933218) (← links)
- Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption (Q4933224) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Pseudo-mixing Time of Random Walks (Q5098785) (← links)
