How to construct random functions
Journal of the ACM (JACM)
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
The notion of security for probabilistic cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Impossibility and optimally results on constructing pseudorandom permutations (extended abstract)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to construct pseudorandom permutations from single pseudorandom functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
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
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Cryptoanalysis of the Cellular Encryption Algorithm
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
Two Practical and Provably Secure Block Ciphers: BEARS and LION
Proceedings of the Third International Workshop on Fast Software Encryption
All-or-Nothing Encryption and the Package Transform
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
About Feistel Schemes with Six (or More) Rounds
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
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
Information Security and Cryptology
Guessing attacks and the computational soundness of static equivalence
Journal of Computer Security
Blockwise adversarial model for on-line ciphers and symmetric encryption schemes
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Efficient constructions of variable-input-length block ciphers
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Enciphering with arbitrary small finite domains
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
HCTR: a variable-input-length enciphering mode
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Length-doubling ciphers and tweakable ciphers
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
How to Enrich the Message Space of a Cipher
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
The security of elastic block ciphers against key-recovery attacks
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
Whereas a block cipher enciphers messages of some one particular length (the blocklength), a variable-input-length cipher takes messages of varying (and preferably arbitrary) lengths. Still, the length of the ciphertext must equal the length of the plaintext. This paper introduces the problem of constructing such objects, and provides a practical solution. Our VIL mode of operation makes a variable-input-length cipher from any block cipher. The method is demonstrably secure in the provable-security sense of modern cryptography: we give a quantitative security analysis relating the difficulty of breaking the constructed (variable-input-length) cipher to the difficulty of breaking the underlying block cipher.