Ashwani K. Bhandari, D.S. Nagaraj, B. Ramakrishnan, "Elliptic Curves, Modular Forms and Cryptography: Proceedings of the Advanced Instructional Workshop on Algebraic Number Theory" English | 2003 | pages: 339 | ISBN: 8185931429 | PDF | 25,3 mb
Bas Edixhoven, "Computational Aspects of Modular Forms and Galois Representations: How One Can Compute in Polynomial Time the Value of R" English | ISBN: 0691142017 | 2011 | 440 pages | EPUB | 16 MB
Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach by William Stein English | PDF | 2009 | 173 Pages | ISBN : 0387855246 | 2.4 MB
The systematic study of number theory was initiated around 300B.C. when Euclid proved that there are infinitely many prime numbers. At the same time, he also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over 1000 years later (around 972A.D.)
Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings by Alfred J. van der Poorten English | PDF | 2008 | 463 Pages | ISBN : 3540794557 | 7.9 MB
This book constitutes the refereed proceedings of the 8th International Algorithmic Number Theory Symposium, ANTS 2008, held in Banff, Canada, in May 2008.
Ayse Alaca, Saban Alaca, "Advances in the Theory of Numbers: Proceedings of the Thirteenth Conference of the Canadian Number Theory Association" 2015 | ISBN-10: 1493932004 | 256 pages | EPUB | 4 MB
Computational Arithmetic Geometry: Ams Special Session April 29-30, 2006 Sanfrancisco State University San Francisco, California By Kristin E. Lauter, Kenneth A. Ribet (ed.) 2008 | 146 Pages | ISBN: 0821843206 | DJVU | 2 MB