Skip to search formSkip to main contentSkip to account menu

Computational number theory

Known as: Algorithmic number theory 
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Adleman–Pomerance–Rumely primality testAlgorithmAlgorithmic Number Theory SymposiumArjen Lenstra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On algorithms to obtain linear determinantal representations of smooth plane curves of higher degree
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As… 
2013
2013
Computational Number Theory
Developed from the authors popular graduate-level course, Computational Number Theory presents a complete treatment of number… 
2013
2013
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field
In this paper, we present a new cube root algorithm in finite field Fq with q a power of prime, which extends the Cipolla-Lehmer… 
2003
2003
Computational Number Theory
Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms… 
Review
2003
Review
2003
Review of number theory for computing
The theory of numbers, in mathematics, is primarily the theory of the properties of integers. The subject has long been… 
Highly Cited
2000
Highly Cited
2000
A Course in Computational Number Theory
Preface. Notation. Chapter 1 Fundamentals. 1.0 Introduction. 1.1 A Famous Sequence of Numbers. 1.2 The Euclidean ALgorithm. The… 
1997
1997
Substitution-Permutation Network Cryptosystems Using Key-Dependent S-Boxes
Substitution-permutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (s-boxes… 
1996
1996
Studies in computational number theory with applications to cryptography
We study various number theoretic problems that arise from cryptographic protocols. Our results are used to prove the security of… 
1992
1992
A generalization of proth's theorem
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gaus sums leads to a… 
1989
1989
Removing randomness from computational number theory
In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in polynomial time have been… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)