Reading List - CSCI 531, Spring 2016

(The paper list is subject to change! Please check regularly for additions/deletions during the semester.)
  • [Garfinkel04a] Simson Garfinkel. “Is Encryption Doomed?” Technology Review (MIT's Magazine of Innovation), September 2004. ACM/IEEE Transactions on Networking, 9(3), June 2001.
  • [Daemon99a] J. Daemen and V. Rijmen. “AES Proposal: Rijndael.” (Version 2 of the original submission for the AES competition.)

  • [AES01a] Federal Information Processing Standards Publication 197. “Specification for the Advanced Encryption Standard (AES).”
Stream Ciphers
  • [Fluhrer01a] S. Fluhrer, I. Martin, and A. Shamir. “Weaknesses in the Key Scheduling Algorithm of RC4.” Proceedings of the 4th Annual Workshop on Selected Areas in Cryptography, August 2001.

  • [Tews07a] E. Tews, R. Weinmann, and A. Pyshkin. “Breaking 104 bit WEP in less than 60 seconds.” Cryptology ePrint Archive: Report 2007/120, April 2007.
Hash Functions
  • [Wang05a] X. Wang and H. Yu. “How to Break MD5 and Other Hash Functions.” In Proceedings of EUROCRYPT, 2005.

  • [Lenstra05a] A. Lenstra and B. de Weger. “On the Possibility of Constructing Meaningful Hash Collisions for Public Keys.” In Proceedings of the 10th Australasian Conference on Information Security and Privacy, Brisbane, Australia, July 2005.
Key Management
  • [Rafaeli03a] S. Rafaeli and D. Hutchison. “A Survey of Key Management for Secure Group Communication.” ACM Computing Surveys, Vol. 35, No. 3, pages 309-329, September 2003.

[Last updated Sat Sep 19 2020]    [Please see copyright regarding copying.]