Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
primality testing
Description:
The use of algorithms or procedures to determine whether an integer is prime or composite.
Primary topic:
Analytic Number Theory Research (64%)
Related topics:
Analytic Number Theory Research (64%),
Cryptography and Residue Arithmetic (18%)
Wikidata ID:
wiki/Q829546
OpenAlex ID:
keywords/primality-testing
PRIMES is in P
2004
·
Manindra Agrawal
, Neeraj Kayal
, et al.
·
Annals of Mathematics
·
1,332
PDF
Probabilistic algorithm for testing primality
1980
·
Michael O Rabin
·
Journal of Number Theory
·
1,062
PDF
Handbook of Elliptic and Hyperelliptic Curve Cryptography
2005
·
Lercier, Reynald
, Lubicz, David
, et al.
·
Chapman & Hall/CRC eBooks
·
1,049
Algorithmic Number Theory: 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000. Proceedings
2000
·
Bosma, Wieb
·
Lecture notes in computer science
·
1,008
Elliptic Curve Public Key Cryptosystems
1993
·
Alfred Menezes
·
Springer eBooks
·
914
Riemann's hypothesis and tests for primality
1976
·
Gary L. Miller
·
Journal of Computer and System Sciences
·
845
PDF
Prime Numbers: A Computational Perspective
2012
·
Richard E. Crandall
, Carl Pomerance
·
724
A Course in Number Theory and Cryptography
1994
·
Neal Koblitz
·
Graduate texts in mathematics
·
709
A Fast Monte-Carlo Test for Primality
1977
·
R. Solovay
, V. Strassen
·
SIAM Journal on Computing
·
702
Elliptic curves: number theory and cryptography
2004
·
Choice Reviews Online
·
557
The New Book of Prime Number Records
1996
·
Paulo Ribenboim
·
Springer eBooks
·
551
Gröbner bases and primary decomposition of polynomial ideals
1988
·
Patrizia Gianni
, Barry Trager
, et al.
·
Journal of Symbolic Computation
·
506
Elliptic Curves and Primality Proving
1993
·
A. O. L. Atkin
, F. Morain
·
Mathematics of Computation
·
481
PDF
Theorems on factorization and primality testing
1974
·
J. M. Pollard
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
476
Introduction to Cryptography
2004
·
Johannes A. Buchmann
·
Undergraduate texts in mathematics
·
440
algorithmic number theory / volume 1
1996
·
Eric Bach
, Jeffrey Shallit
·
437
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
1986
·
D.V Chudnovsky
, G.V Chudnovsky
·
Advances in Applied Mathematics
·
342
On Distinguishing Prime Numbers from Composite Numbers
1983
·
Leonard M. Adleman
, Carl Pomerance
, et al.
·
Annals of Mathematics
·
335
An Introduction to Mathematical Cryptography
2014
·
Jeffrey Hoffstein
, Jill Pipher
, et al.
·
Undergraduate texts in mathematics
·
313
An introduction to mathematical cryptography
2009
·
Hoffstein, Jeffrey 1953-
, Pipher, Jill 1955-
, et al.
·
Choice Reviews Online
·
283
Explicit Bounds for Primality Testing and Related Problems
1990
·
Eric Bach
·
Mathematics of Computation
·
280
PDF
The first ten years of public-key cryptography
1988
·
W. Diffie
·
Proceedings of the IEEE
·
266
Prime numbers : a computational perspective / Richard Crandall and Carl Pomerance
2005
·
Richard E. Crandall
·
263
Elliptic Curves: Number Theory and Cryptography, Second Edition
2008
·
Lawrence C. Washington
·
243
Prime Numbers and Computer Methods for Factorization
1994
·
Hans Riesel
·
Birkhäuser Boston eBooks
·
240
Show more works
View as search
Works count:
3,042
Citation count:
23,680
Year
Topic
Type