Abstract
Since 1995–96 I have taught, using Maple, a yearly course on Number Theory and Cryptography to my undergraduate students1. In this paper I outline some basic number theoretical topics related to cryptography, based on my experience as a teacher of those topics. I am omitting all reference to practical teaching details, but will happily forward all teaching materials (notes, examination papers, etc.) to any interested readers. Finally, several of my NT and Cryptography course Maple worksheets2 are available on the internet [Cos].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bach, E. and Shallit, J.: Algorithmic Number Theory. Volume 1. The MIT Press. (1996)
Bressoud, D. M.: Factorization and primality testing. Springer-Verlag. (1989)
Brilihart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B. and Wagstaff, Jr., S. S.: Factorizations of b n ± 1 (b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers), AMS (Contemporary Mathematics Series), Vol. 22, 2nd edition, 1988.
Cohen, H.: A Course in Computational Algebraic Number Theory. Springer-Verlag. (1993)
Cosgrave, J. B.: Several of my Maple worksheets relating to my NT and Cryptography course, including the substantial 27 public lecture of 25th November 1998, Bill Clinton, Bertie Ahern 28, and digital signatures, are accessible from David Joyner’s USNA Web site at this address: http://web.usna.navy.mil/~wdj/crypto.htm At the time of preparing this paper my own web site http://www.spd.dcu.ie johnbcos is under construction, and when that is completed I will be putting up a considerable number of my Maple worksheets on that site. Alternatively, please contact me at my College using John.Cosgrave@spd.ie, or at home johnbcos@iol.ie.
Diffie, W. and Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory, v. IT-22, n. 6, (Nov 1976) 109–112
Kahn, D.: The Codebreakers (The Comprehensive History of Secret Communication from Ancient Times to the Internet) (1996) Scribner
Koblitz, N.: A Course in Number Theory and Cryptography. Springer-Verlag. (1994)
Lenstra, H. W. and Tijdeman, R. (Editors): Computational Methods in Number Theory. Math. Centre Tracts 154 Mathematisch Centrum. Amsterdam. (1982)
Pollard, J. M.: Theorems on Factorization and Primality Testing. Proc. Camb. Phil. Soc. 76 (1974) 521–528
Pollard, J. M.: A Monte Carlo Method for Factorization. BIT. 15 (1975) No. 3. 331–335.
Pomerance, C.: Cryptology and Computational Number Theory. Mathematical Association of America. MAA Notes. 4 (1984)
Pomerance, C. (Editor): Cryptology and Computational Number Theory. American Mathematical Society. Proceedings of Symposia in Applied Mathematics. 42 (1990)
Pomerance, C.: A Tale of Two Sieves. Notices of the American Mathematical Society. 43 No. 12. (1996) 1473–1485
Riesel, H.: Prime Numbers and Computer Methods for Factorization. Birkhäuser. (1994)
Rivest, R.L., Shamir, A., and Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM. 21 (2), (1978) 120–126
Rosen, K. H.: Elementary Number Theory and Its Applications. Addison-Wesley. (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cosgrave, J. (2000). Number Theory and Cryptography (using Maple). In: Joyner, D. (eds) Coding Theory and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59663-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-59663-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66336-2
Online ISBN: 978-3-642-59663-6
eBook Packages: Springer Book Archive