Ciphers secure against related-key attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3017, Issue , 2004, Pages 359-370

  Lucks, Stefan ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Block ciphers; Concrete security; Provable security; Pseudorandom functions; Related key attacks

Indexed keywords

CONCRETE BLOCKS; SECURITY OF DATA;

BLOCK CIPHERS; CONCRETE SECURITIES; PROVABLE SECURITY; PSEUDO-RANDOM FUNCTIONS; RELATED KEY ATTACKS;

CRYPTOGRAPHY;

EID: 35048857407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25937-4_23     Document Type: Article

References (15)

1. M. Bellare, T. Kohno. A theoretical treatment of related-key attacks: RKA-PRPs RKA-PRFs and applications. E. Biham, editor, Eurocrypt 2003, Springer Lecture Notes in Computer Science # 2654, pp. 491-506.
2. M. Bellare, T. Kohno. A theoretical treatment of related-key attacks: RKA-PRPs RKA-PRFs and applications. March 18, 2003. Full version of [1]. http://www.cs.ucsd.edu/users/tkohno/papers/RKA/ (URL checked: Jan. 14, 2004).
3. E. Biham. New types of cryptanalytic attacks using related keys. T. Helleseth, editor, Eurocrypt 93, Springer Lecture Notes in Computer Science # 765, pp. 398-409.
4. J. Daemen, V. Rijmen. AES proposal: Rijndael.
5. J. Daemen, V. Rijmen. The design of Rijndael, Springer-Verlag, 2002.
6. Morris Dworkin. DRAFT Recommendation for block cipher modes of operation: the RMAC authentication mode. NIST Special Publication 800-38b. October 18, 2002.
7. N. Ferguson, J. Kelsey, S. Lucks, B. Schneier, M. Stay, D. Wagner, D. Whiting. Improved cryptanalysis of Rijndael. B. Schneier, editor, Fast Software Encryption 2000, Springer Lecture Notes in Computer Science # 1978, pp. 213-230.
8. E. Jaulmes, A. Joux, F. Valette. On the security of randomized CBC-MAC beyond the birthday paradox limit: A new construction. J. Daemen, V. Rijmen, editors, Fast Software Encryption 2002, Springer Lecture Notes in Computer Science.
9. J. Kelsey, B. Schneier, D. Wagner. Key-schedule cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES. N. Koblitz, editor, Crypto '96, Springer Lecture Notes in Computer Science # 1109, pp. 237-251.
10. J. Kelsey, B. Schneier, D. Wagner. Related-key cryptanalysis of 3-Way, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA. Y. Han, T. Okamoto, S. Quing, editors, Information and Communications Security '97, Springer Lecture Notes in Computer Science # 1334, pp. 233-246.
11. L. Knudsen. Cryptanalysis of LOK191. J. Seberry, Y. Zheng, editors, Auscrypt '92, Springer Lecture Notes in Computer Science # 718, pp. 196-208.
12. L. Knudsen, T. Kohno. Analysis of RMAC. T. Johansson, editor, Fast Software Encryption 2003, Springer Lecture Notes in Computer Science # 2887, pp. 182-191.
13. M. Liskov, R. Rivest, D. Wagner. Tweakable block ciphers. M. Yung, editor, Crypto '02, Springer Lecture Notes in Computer Science # 2422, pp. 31-46.
14. M. Naor, O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology, vol 12, 1999, pp. 29-66.
15. D. Pointcheval. New public key cryptosystems based on the dependent-RSA problems. Jacques Stern, editor, Eurocrypt 1999, Springer Lecture Notes in Computer Science # 1592, pp. 239-254.