Aug

23

MAT 1195HF ELLIPTIC CURVES AND CRYPTOGRAPHY: MATHEMATICAL ASPECTS OF CRYPTOGRAPHY R. Venkatesan Mondays and Tuesdays, 10-11:30 a.m., in HU 1018, 215 Huron St. We will study a number of papers related to design, algorithms and security analysis of cryptographic primitives based on hard problems in number theory, elliptic curves, and other domains such as codes and lattices. Dixons algorithm, Number field sieve, Pollard Rho, Bit security of some primitives. Attacks on Knapsacks and RSA variants, Authentication protocols and use of Zero-Knowledge primitives, Schemes for cloud scenarios. Brief look at complexity issues and the construction of hash functions, MACS, and Ciphers, and attacks on them. Prerequisites: Students should have some introduction to number theory, and elliptic curves. Useful references: http://www.amazon.com/Introduction-Modern-Cryptography-Principles-Protocols/dp/1584885513/ref=sr_1_1?ie=UTF8&qid=1314023370&sr=8-1 http://www.amazon.com/Elliptic-Curves-Cryptography-Mathematics-Applications/dp/1420071467/ref=sr_1_3?s=books&ie=UTF8&qid=1314023661&sr=1-3 http://www.amazon.com/Introduction-Cryptography-Discrete-Mathematics-Applications/dp/1584886188/ref=sr_1_3?s=books&ie=UTF8&qid=1314023761&sr=1-3#_ --------------------------------------------------------------

## no comment as of now