Patel, S., Ramzan, Z., and Sundaram, G. Towards making Luby-Racko ciphers optimal and practical. In Fast Software Encryption (1999), vol. 1636 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)
....(when using three and four rounds) and their work has 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 ....
Patel, S., Ramzan, Z., and Sundaram, G. Towards making Luby-Racko ciphers optimal and practical. In Fast Software Encryption (1999), vol. 1636 of Lecture Notes in Computer Science, Springer-Verlag.
Ciphers with Arbitrary Finite Domains - Black, Rogaway (2001) (7 citations) (Correct)
....(when using three and four rounds) and their work has 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 ....
Patel, S., Ramzan, Z., and Sundaram, G. Towards making Luby-Racko ciphers optimal and practical. In Fast Software Encryption (1999), vol. 1636 of Lecture Notes in Computer Science, Springer-Verlag.
Ciphers with Arbitrary Finite Domains - May (2000) (Correct)
....(when using three and four rounds) and their work has 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 ....
Patel, S., Ramzan, Z., and Sundaram, G. Towards making Luby-Racko ciphers optimal and practical. In Fast Software Encryption (1999), vol. 1636 of Lecture Notes in Computer Science, Springer-Verlag.
On the Round Security of Symmetric-Key Cryptographic Primitives - Ramzan, Reyzin (2000) (1 citation) Self-citation (Ramzan) (Correct)
....and an exclusive or operation. Each round s output is used for the next round s input, except for the last round, whose output is the output of the block cipher. Much of the theoretical research that followed the work of [14] focused on eciency improvements to this construction (e.g. see [15] [18] and references therein) All of these variations can also be naturally broken up into rounds. This theme of an inherent round structure in block ciphers is also seen extensively in practice. For example, a number of ciphers, including DES [16] and many of the AES submissions [17] have an inherent ....
....symmetric constructions secure, and enables us to make statements about security that are not captured by the traditional model. 1.3. 2 Round Security of Luby Racko Ciphers We completely characterize the round security of the Luby Racko construction and its more e cient variants from [15] and [18]. That is, we precisely specify the sets of rounds that the adversary 2 can access for the cipher to remain secure, and show that access to other sets of rounds will make the cipher insecure. The cipher proposed by Luby and Racko [14] operates on a 2n bit string (L; R) and can be described ....
[Article contains additional citation context not shown here]
S. Patel, Z. Ramzan, and G. Sundaram. Towards making Luby-Racko ciphers optimal and practical. In Proc. Fast Software Encryption 99, Lecture Notes in Computer Science. SpringerVerlag, 1999.
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