How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Security for computer networks: and introduction to data security in teleprocessing and electronic funds transfer (2nd ed.)
A fast software one-way hash function
Journal of Cryptology
Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Differential-Linear Cryptanalysis
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
MDx-MAC and Building Fast MACs from Hash Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved security bounds for pseudorandom permutations
Proceedings of the 4th ACM conference on Computer and communications security
Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Generic Attacks on Feistel Schemes
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The State of Cryptographic Hash Functions
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
About Feistel Schemes with Six (or More) Rounds
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
New Constructions for Secure Hash Functions
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Towards Making Luby-Rackoff Ciphers Optimal and Practical
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
New Results on the Pseudorandomness of Some Blockcipher Constructions
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Security of the Five-Round KASUMI Type Permutation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Generic Attacks on Feistel Networks with Internal Permutations
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
The sum of PRPs is a secure PRF
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The security of many-round Luby-Rackoff pseudo-random permutations
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Domain extension of public random functions: beyond the birthday Barrier
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Multilane HMAC: security beyond the birthday limit
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Generic attacks on unbalanced Feistel schemes with expanding functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
A proof of security in O(2n) for the Benes scheme
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Generic attacks on misty schemes
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Domain extension for MACs beyond the birthday barrier
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Generic attacks on unbalanced feistel schemes with contracting functions
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Bitwise higher order differential cryptanalysis
INTRUST'09 Proceedings of the First international conference on Trusted Systems
Benes and butterfly schemes revisited
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
On linear systems of equations with distinct variables and small block size
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Generic attacks for the Xor of k random permutations
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
For many cryptographic primitives, e.g., hashing and psendorandom functions & generators, doubling the output length is useful even if the doubling transformation is not reversible. For these cases, we present a non-reversible construction based on a Belies network, as an alternative to the traditional Feistel construction (which is the basis of DES). Assuming that a given primitive behaves likc an n-bit to n-bit random function, we present a length-doubling scheme that yields a 2n-bit to 2n-bit function that provably requires Ω(2n) queries to distinguish with Θ(1) probability from a truly random function of that length. This is true even if the adversary is of unlimited computing power arid is allowed to query the function adaptively. Oiir construction is minimal in the sense that omitting any operation makes the resulting network susceptible to birthday attacks using O(2n/2) queries. Feistel networks also use truly random n-bit functions to achieve 2n- bit functions. Luby and Rackoff [16] showed that 3 and 4 round Feistel networks require Ω(2n/2) queries to distinguish with Θ(1) probability from truly random. We show that these bounds are tight by showing that these networks are susceptible various types of birthday attacks using O(2n/2) queries.