Security amplification by composition: The case of doubly-iterated, ideal ciphers-Reference-Cited by-同舟云学术

Security amplification by composition: The case of doubly-iterated, ideal ciphers

Published:1998 Issue: Volume: Page:390-407
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO '98
language:
Short-container-title:

Author:

Aiello W.,Bellare M.,Di Crescenzo G.,Venkatesan R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055743

Reference15 articles.

1. W. Aiello, M. Bellare, G. Di Crescenzo and R. Venkatesan, “Security Amplification by Composition: The case of Doubly-Iterated, Ideal Ciphers,” Full version of this paper, available via http://www-cse.ucscl.edu/users/mihir.

2. M. Bellare, J. Kilian and P. Rogaway, “The security of cipher block chaining”, Advances in Cryptology — Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.

3. E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystems,” J. of Cryptology, Vol. 4, No. 1, pp. 3–72, 1991.

4. E. Biham and A. Shamir, “Differential cryptanalysis of the Full 16-round DES,” Advances in Cryptology — Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.

5. W. Diffie and M. Hellman, “Exhaustive cryptanalysis of the NBS data encryption standard,” Computer, Vol. 10, No. 6, pp. 74–84, June 1977.

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Multiple Encryption for Public-Key Cryptography;Cryptography;2023-10-06

2. RPM: Additive Stream Ciphers for Lightweight Communication Security;13th International Conference on Security of Information and Networks;2020-11-04

3. Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications;Advances in Cryptology – EUROCRYPT 2020;2020

4. Securing Cloud Data Under Key Exposure;IEEE Transactions on Cloud Computing;2019-07-01

5. Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries;Theory of Cryptography;2018