From Ioannis Kourouklides
Revision as of 20:33, 23 October 2017 by Kourouklides (talk | contribs) (Created page with "This page contains resources about [ Cryptography] and [ Number Theory] in general. ==...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

This page contains resources about Cryptography and Number Theory in general.

Subfields and Concepts

  • Modular Arithmetic
    • Lowest Common Multiple (LCM)
    • Greatest Common Divisor (GCD)
    • Prime factorization
    • Euclidean Algorithm
    • Chinese Remainder Theorem
    • Diophantine Equations
    • Euler's Theorem
    • Fermat's Little Theorem
    • Wilson's Theorem
    • Fermat's Method of Infinite Descent
  • Cryptology
    • RSA Algorithm

Online courses

Video Lectures

Lecture Notes


  • Zhou, X. (2017). Number Theory - Modular Arithmetic: Math for Gifted Students. CreateSpace. 
  • Αντωνιάδης, Α. Γ., & Αριστείδης, Κ. (2015). Θεωρία Αριθµών και Εφαρµογές. Σύνδεσµος Ελληνικών Ακαδηµαϊκών Βιβλιοθηκών. [in Greek] (link
  • Hong-Bing, Y. (2009). Problems of Number Theory in Mathematical Competitions (Volume 2). World Scientific. 
  • Andreescu, T., & Andrica, D. (2009). Number Theory: Structures, Examples, and Problems. Birkhäuser. 
  • Crawford, M. (2008). Introduction to Number Theory. 2nd Ed. AoPS Incorporated.
  • Andreescu, T., Andrica, D., & Feng, Z. (2007). 104 number theory problems: From the training of the USA IMO team. Birkhäuser.
  • Stopple, J. (2003). A primer of analytic number theory: from Pythagoras to Riemann. Cambridge University Press.


See also

Other Resources