CS60082 Computational Number Theory | Spring 2010, Credit: 3-0-0 |
Slot: E (W 11:30-12:25, Th: 10:30-11:25, F: 08:30-10:25)
Venue: CSE 108
Teaching Assistant: Anup Kumar Bhattacharya, Satrajit Ghosh
List of students
I will mercilessly assume that a student registering for this course is equipped with rudimentary knowledge of discrete mathematical structures (groups, rings, fields), algorithms (design and analysis techniques), and probability. Students lacking one or more of these backgrounds may find the exposition difficult to follow. I will, under no circumstances, entertain requests to cover these elementary topics in this course. Note, however, that no prior acquaintance with number theory (elementary, analytic, or algebraic) is necessary for attending this course.
[1] | V. Shoup, A computational introduction to number theory and algebra, Cambridge University Press. |
[2] | M. Mignotte, Mathematics for computer algebra, Springer-Verlag. |
[3] | I. Niven, H. S. Zuckerman and H. L. Montgomery, An introduction to the theory of numbers, John Wiley. |
[4] | J. von zur Gathen and J. Gerhard, Modern computer algebra, Cambridge University Press. |
[5] | R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press. |
[6] | A. J. Menezes, editor, Applications of finite fields, Kluwer Academic Publishers. |
[7] | J. H. Silverman and J. Tate, Rational points on elliptic curves, Springer International Edition. |
[8] | D. R. Hankerson, A. J. Menezes and S. A. Vanstone, Guide to elliptic curve cryptography, Springer-Verlag. |
[9] | A. Enge, Elliptic curves and their applications to cryptography: An introduction, Kluwer Academic. |
[10] | A. Das and C. E. Veni Madhavan, Public-key cryptography: Theory and practice, Pearson Education Asia. |
[11] | H. Cohen, A course in computational algebraic number theory, Springer-Verlag. |