Proper noun
computational number theory
(mathematics, number theory) The field of study dealing with computational methods for investigating and solving problems in number theory and arithmetic geometry.
Topics studied in computational number theory include algorithms for primality testing and integer factorisation, finding solutions to Diophantine equations and explicit methods in arithmetic geometry.
Computational number theory has applications in cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis.