Lecture notes

Generic case complexity

1. Robert Gilman (Stevens Institute of Technology), Generic Complexity.
   The International Conference "METHODS OF LOGIC IN MATHEMATICS" (June 1 - 7, 2006, St. Petersburg)
2. Alexei Miasnikov (McGill University, Stevens Institute of Technology), Asymptotic algebra and modern cryptanalysis.
   Lecture 1   Lecture 2   Lecture 3
   The International Conference "METHODS OF LOGIC IN MATHEMATICS" (June 1 - 7, 2006, St. Petersburg)
3. Alexander N. Rybalov (Omsk State University), On the strongly generic undecidability of the halting problem.
   Generic Complexity Seminar (Stevens Institute of Technology)

Cryptography

1. Alexandra Boldyreva (Georgia Institute of Technology), Public-Key Encryption in a Multi-User Setting: Privacy, Anonymity and Efficiency.
   Algebra and Cryptography Seminar (Stevens Institute of Technology)
2. Vladimir Shpilrain (The City College of New York) Random subgroups of braid groups: cryptanalysis of a braid group based cryptographic protocol.
   joint with Alexei G. Myasnikov and Alexander Ushakov
   Algebra and Cryptography Seminar (Stevens Institute of Technology)
3. Rainer Steinwandt (Florida Atlantic University), Towards Provably Secure Asymmetric Encryption Building on Finite Non-Abelian Groups
   Algebra and Cryptography Seminar (Stevens Institute of Technology)
4. Rainer Steinwandt (Florida Atlantic University), Non-Abelian Groups as Candidate Platform for Cryptographic Schemes: Strengths and Weaknesses
   Algebra and Cryptography Seminar (Stevens Institute of Technology)
5. Yacov Yacobi (Microsoft), A New Related Message Attack on RSA
   Algebra and Cryptography Seminar (Stevens Institute of Technology)