Lucks, S. Faster Luby-Racko ciphers. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ciphers with Arbitrary Finite Domains - Black, Rogaway (2000) (7 citations) (Correct)
....spawned much related analysis, too. Naor and Reingold [11] provide a di erent construction which extends a block cipher on n bits to a block cipher on 2ni bits, for any i 1. A variation on their construction due to Patel, Ramzan and Sundaram [12] yields a cipher on ni bits for any i 1. Lucks [10] generalizes Luby Racko to consider a three round unbalanced Feistel network, using hash functions for round functions. This yields a block cipher for any given length N starting with a PRF from r bits to bits and another from bits to r bits, where r = N . Starting from an n bit block ....
Lucks, S. Faster Luby-Racko ciphers. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag.
Ciphers with Arbitrary Finite Domains - Black, Rogaway (2001) (7 citations) (Correct)
....spawned much related analysis, too. Naor and Reingold [10] provide a di erent construction which extends a block cipher on n bits to a block cipher on 2ni bits, for any i 1. A variation on their construction due to Patel, Ramzan and Sundaram [11] yields a cipher on ni bits for any i 1. Lucks [9] generalizes Luby Racko to consider a three round unbalanced Feistel network, using hash functions for round functions. This yields a block cipher for any given length N starting with a PRF from r bits to bits and another from bits to r bits, where r = N . Starting from an n bit block ....
Lucks, S. Faster Luby-Racko ciphers. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag.
Ciphers with Arbitrary Finite Domains - May (2000) (Correct)
....spawned much related analysis, too. Naor and Reingold [10] provide a di erent construction which extends a block cipher on n bits to a block cipher on 2ni bits, for any i 1. A variation on their construction due to Patel, Ramzan and Sundaram [11] yields a cipher on ni bits for any i 1. Lucks [9] generalizes Luby Racko to consider a three round unbalanced Feistel network, using hash functions for round functions. This yields a block cipher for any given length N starting with a PRF from r bits to bits and another from bits to r bits, where r = N . Starting from an n bit block ....
Lucks, S. Faster Luby-Racko ciphers. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag.
Scramble All, Encrypt Small - Jakobsson, Stern, Yung (1999) (2 citations) (Correct)
.... large s boxes ) were rst investigated by Luby and Racko [LR88] their functions were based, in fact, on pseudorandom functions. Many other investigations followed which included simpli cations of the analysis and the proof of security and variations simpli cations of the round functions (see [Mau92, Luc96, NR97]) In particular, employing stream ciphers for fast block message encryption in the style of Luby Racko was presented in [AB96] Their design like the one in this work is suitable for block cipher operations for large blocks, which may be typical in software oriented mechanisms. Adding public ....
Stefan Lucks. Faster Luby-Racko Ciphers. In Dieter Gollman, editor, Fast Software Encryption: Third International Workshop, number 1039 in Lecture Notes in Computer Science, pages 189-203, 1996. Springer-Verlag.
The Sum of PRPs is a Secure PRF - Lucks (2000) (5 citations) Self-citation (Lucks) (Correct)
....bit generators from one way functions , Goldreich, Goldwasser, and Micali [6] constructed PRFs from pseudorandom bit generators , and Luby and Racko [9] constructed PRPs from PRFs. A lot of work has been done on improvements of the Luby Racko construction, some recent examples are [10 12]. Now we are going into the opposite direction: We construct PRFs from PRPs. Another direction of cryptographic research was how to construct PRFs from smaller PRFs. Aiello and Venkatesan [1] presented a construction for PRFs over f0; 1g 2n using PRFs over f0; 1g n as building blocks. 3.3 ....
S. Lucks, \Faster Luby-Racko Ciphers", Fast Software Encryption 1996, Springer LNCS 1039, 189-205.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC