There is a strong connection between the high-brow mathematics used
(such as elliptic curves, numbers fields, etc.) and the use of modern
computing means (parallelism, networks). These two main streams are
represented at LIX.
[AdRiSh78] L. M. Adleman, R. L. Rivest, and A. Shamir. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120--126, 1978.
[DiHe76] W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. on Information Theory, IT-22-6, November 1976.
[Bressoud89] D. Bressoud. Factorization and primality testing. Undergraduate Texts in Mathematics. Springer-Verlag, 1989.
[Cohen93] Henri Cohen. A course in algorithmic algebraic number theory, volume 138 of Graduate Texts in Mathematics. Springer--Verlag, 1993.
[Knuth81] D. E. Knuth. The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesley, 2nd edition, 1981.
[Koblitz87b] Neal Koblitz. A course in number theory and cryptography, volume 114 of Graduate Texts in Mathematics. Springer--Verlag, 1987.
[Kranakis1986] Evangelos Kranakis. Primality and cryptography. Wiley-Teubner Series in Computer Science. John Wiley & Sons, 1986.
[Riesel85] Hans Riesel. Prime numbers and computer methods for factorization, volume 57 of Progress in Mathematics. Birkhäuser, 2nd edition, 1985.