The DOI matches its Crossref record.
A Course in Number Theory and Cryptography
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“From r , at least one factor of N is given by the greatest common denominator (gcd) of a r/ 2 ± 1 and N (with probability greater than 1 / 2); the gcd can be computed efficiently using Euclid's algorithm on a classical computer [2] .”
From Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance (2001) · cites this paper as [2]
Citations
Cited by
Sorted by citations
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. A. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 687
Self-citationA verifiable secret shuffle and its application to e-voting
Neff, C. A. (2001) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/501983.502000 · Cited by 513
Du, X., Guizani, M., Xiao, Y., & Chen, H. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.060598 · Cited by 380
Efficient Arithmetic on Koblitz Curves
Solinas, J. A. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008306223194 · Cited by 345
Metadata
- Authors
- Koblitz, N.
- Affiliations
- University of Washington (US)
- Corresponding author
- Koblitz, Neal
- ORCID
- Koblitz, Neal
- Venue
- Graduate Texts in Mathematics
- Publisher
- Springer New York
- Published
- 1994
- ISSN
- 0072-5285 (ISSN-L)
- OpenAlex
- W4230398518
- Cited by
- 576
- References
- 0
- Citations by year
- 2026: 9 · 2025: 42 · 2024: 15 · 2023: 26 · 2022: 31 · 2021: 14 · 2020: 35 · 2019: 20 · 2018: 17 · 2017: 10 · 2016: 11 · 2015: 35 · 2014: 24 · 2013: 27 · 2012: 38
- FWCI
- 2.04
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Graduate texts in mathematics (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Keywords
- number theory, cryptography, modular arithmetic, public-key cryptography, elliptic curves, primality testing, integer factorization, discrete logarithm problem
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
