Abstract
This paper deals with a generalization of Luby's and Rackoff's results [9] on the construction of block ciphers and their consequences for block cipher implementations. Based on dedicated hash functions, block ciphers are proposed which are more efficient and operate on larger blocks than their original Luby-Rackoff counterparts.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Anderson, The Classification of Hash Functions, in: Fourth IMA conference on cryptography and coding, 83–93.
R. Anderson, On Fibonacci Keystream Generators, in: Fast Software Encryption (1994), Springer LNCS 1008, 346–352.
M. Blaze, B. Schneier, The MacGuffin Block Cipher Algorithm, in: Fast Software Encryption (1994), Springer LNCS 1008, 96–110.
O. Goldreich, S. Goldwasser, S. Micali, How to Construct Random Functions, in: 21st ACM SToC, 25–32, 1989.
P. Gutmann, documentation to SFS release 1.20, especially parts SFS6.DOC and SFS7.DOC, URL: “http://www.cs.auckland.ac.nz/pgut01/sfs.html”, 1995.
J. Håstad, Pseudo-Random Generators under Uniform Assumptions, in: 22st ACM SToC, 395–404, 1990.
R. Impagliazzo, L. Levin, M. Luby, Pseudo-random generation from one-way functions, in: 21st ACM SToC, 12–24, 1989.
B. Kaliski, M. Robshaw, Fast Block Cipher Proposal, in: Fast Software Encryption (1993), Springer LNCS 809, 1994, 33–40.
M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, in: SIAM J. Computing, Vol. 17, No. 2, 373–386.
U. Maurer, A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators, in: EuroCrypt '92, 239–255.
R. Needham, D. Wheeler, Tea, a Tiny Encryption Algorithm, in: Fast Software Encryption (1994), Springer LNCS 1008, 363–366.
J. Pieprzyk, B. Sadeghiyan, Design of Hashing Algorithms, Springer, 1993
M. Rabin, Fingerprinting by Random Polynomials, Harvard Univ. Tech. Rep. TR-15-81, 1981.
Race Integrity Primitives Evaluation (RIPE): final report, RACE 1040, 1993.
P. Rogaway, D. Coppersmith, A Software-Optimized Encryption Algorithm, in: Fast Software Encryption (1993), Springer LNCS 809, 1994, 56–63.
M. Roe, Performance of Block Ciphers and Hash Functions — One Year Later, in: Fast Software Encryption (1994), Springer LNCS 1008, 359–362.
B. Schneier, Applied Cryptography, Wiley, 1993.
D. Wheeler, A Bulk Data Encryption Algorithm, in: Fast Software Encryption (1993), Springer LNCS 809, 1994, 127–134.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucks, S. (1996). Faster Luby-Rackoff ciphers. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_53
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive