Math 810C (Special topics in cryptography), Fall 2012

Lectures:  Th  2:00 - 4:00, room McLean 105

Lecturer: Vladimir Shpilrain  Phone: (212) 650-5158
e-mail:   web page:

Office hours:  by appointment

Homework: Homework problems will be assigned in class once a week or once every two weeks.

Textbook:  A. G. Myasnikov, V. Shpilrain, and A. Ushakov,   Non-commutative cryptography and complexity of group-theoretic problems,  Amer. Math. Soc. Surveys and Monographs, 2011.

Additional reading::  J. Katz, Y. Lindell,   Introduction to Modern Cryptography: Principles and Protocols,  CRC, 2007.
J. Talbot, D. Welsh,   Complexity and Cryptography: An Introduction,  Cambridge University Press, 2006.

Material to be covered (tentative):

Background on public-key cryptography (Chapter 1)

Background on combinatorial group theory (Chapter 2)

Non-commutative cryptography (Chapter 4)

Platform groups (Chapter 5)

Using decision problems in public-key cryptography (Chapter 7)

Authentication (Chapter 8)

Generic complexity and cryptanalysis (Chapters 10, 14, 15)

Followed by some material not included in the textbook:

Secret sharing

New horizons in public-key cryptography: learning with errors; public-key cryptography without one-way functions.