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
Items 201–300 of 573
Non-Deterministic Finite Cover Automata
Câmpeanu, C. (2015) · Scientific Annals of Computer Science · doi:10.7561/sacs.2015.1.3 · Cited by 4
Simplifying Nondeterministic Finite Cover Automata
Câmpeanu, C. (2014) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.151.11 · Cited by 4
Comparison of selected cryptosystems using single-scale and poly-scale measures
Gonzalez, J. D. T., & Kinsner, W. (2013) · IEEE International Conference on Cognitive Informatics and Cognitive Computing · doi:10.1109/icci-cc.2013.6622230 · Cited by 4
On Security of Hill Cipher using Finite Fields
Sharma, P., & Rehan, M. (2013) · International Journal of Computer Applications · doi:10.5120/12348-8637 · Cited by 4
Wang, M., Fan, K., Xiao-ji, L., et al. (2006) · IEEE International Conference on Communication Technology (ICCT) · doi:10.1109/icct.2006.341747 · Cited by 4
A new undeniable signature scheme on general linear group over group ring
Pandey, A., & Gupta, I. (2020) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2020.1744814 · Cited by 4
Pseudo Random Binary Sequence Based on Cyclic Difference Set
Mamun, M. S. A., & Akhter, F. (2020) · Symmetry · doi:10.3390/sym12081202 · Cited by 4
Secure Communication for Healthcare Using Homomorphic Encryption: A Comparative Study
Nayak, N., Anchan, P. G., Karthik Raj, M., et al. (2023) · doi:10.1109/incoft60753.2023.10425159 · Cited by 4
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
Geffert, V. (2018) · Theory of Computing Systems · doi:10.1007/s00224-018-9844-7 · Cited by 4
Nanjo, Y., Shirase, M., Kusaka, T., & Nogami, Y. (2019) · International Symposium on Computing and Networking · doi:10.1109/candar.2019.00030 · Cited by 4
Improved cryptanalysis of a ElGamal Cryptosystem Based on Matrices Over Group Rings
Pandey, A., Gupta, I., & Singh, D. K. (2020) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2019-0054 · Cited by 4
The Cryptanalysis of the Enigma Cipher. The Plugboard and the Cryptologic Bomb
Anna, B., & Elzbieta, R. (2014) · Computer Science · doi:10.7494/csci.2014.15.4.365 · Cited by 4
On Optimization of Miller-Rabin Primality Test on TI TMS320C54x Signal Processors
Đorđević, G. T., & Marković, M. (2007) · doi:10.1109/iwssip.2007.4381195 · Cited by 4
RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
Brandner, G. (2012) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-012-0181-9 · Cited by 4
Evaluating the Security Level of a Cryptosystem based on Chaos
Gonzalez, J. D. T., & Kinsner, W. (2012) · International Journal of Software Science and Computational Intelligence · doi:10.4018/jssci.2012070105 · Cited by 4
A New Variant of the Diffie-Hellman Key-Exchange Protocol Based on Block Triangular Matrix Groups
Yang, J., & Yang, X. (2008) · International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP) · doi:10.1109/iih-msp.2008.247 · Cited by 4
Batina, L., Mentens, N., Preneel, B., et al. (2006) · doi:10.1109/asap.2005.57 · Cited by 4
Elliptic curve Cryptography and Diffie- Hellman Key exchange
Vasundhara, S. (2017) · IOSR Journal of Mathematics · doi:10.9790/5728-1301015661 · Cited by 4
Quantum simulation of the integer factorization problem: Bell states in a Penning trap
Rosales, J. L., & Martín, V. (2018) · Physical Review A · doi:10.1103/physreva.97.032325 · Cited by 4
Alla, K., Praneetha, & Vedantham, R. (2020) · Lecture notes in networks and systems · doi:10.1007/978-981-15-0630-7_26 · Cited by 4
Addressing credential revocation in grid environments
Sundaram, B., & Chapman, B. (2005) · IEEE/ACM International Conference on Grid Computing (GRID) · doi:10.1109/grid.2005.1542764 · Cited by 4
Joint Interoperability: Fog or Lens for Joint Vision 2010
Reddy, P. C. (1997) · Defense Technical Information Center (DTIC) · doi:10.21236/ada388057 · Cited by 4
A novel and provably secure identity-based blind signature scheme for online transactions
Kumar, S., Mittal, G., & Yadav, A. (2025) · Sadhana · doi:10.1007/s12046-025-02694-1 · Cited by 3
Gram-Schmidt Orthogonalization on Encrypted Vectors
Failla, P., & Barni, M. (2011) · Springer eBooks · doi:10.1007/978-88-470-1818-1_7 · Cited by 3
Koblitz, N. (2001) · Springer eBooks · doi:10.1007/978-3-642-56478-9_38 · Cited by 3
Self-citationElliptic-Curve based Crypto-Compression Scheme For Medical Videos in Connected Ambulance
Cidjeu, D. D., Tchappi, I., Najjar, A., Mualla, Y., & Galland, S. (2023) · Procedia Computer Science · doi:10.1016/j.procs.2023.03.069 · Cited by 2
Enhancing Industrial Robot Arms Data Security with a Hybrid Encryption Approach
Erbil, M. E., Özkahraman, M., & BAYRAKÇI, H. C. (2024) · Sakarya University Journal of Science · doi:10.16984/saufenbilder.1440949 · Cited by 3
Romańczuk, U., & Ustimenko, V. (2012) · Mathematics in Computer Science · doi:10.1007/s11786-012-0115-8 · Cited by 3
An FPGA based processor for Elliptic Curve Cryptography
Xi-ning, C., & Yang, J. (2012) · doi:10.1109/csip.2012.6308865 · Cited by 3
Two‐Key Dependent Permutation for Use in Symmetric Cryptographic System
Kuppusamy, A., Iyer, S. P., & Krithivasan, K. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/795292 · Cited by 3
Hankel determinant solution for elliptic sequence
Yura, F. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.06.016 · Cited by 3
Robust Comparative Analysis of Zero-Knowledge Proofs using Discrete Logarithm Problem
Sah, C. P., & Gupta, P. R. (2020) · International Conference on Computing for Sustainable Global Development · doi:10.23919/indiacom49435.2020.9083721 · Cited by 3
Roldán-Zafra, J., & Perea, C. (2022) · Mathematics · doi:10.3390/math10224335 · Cited by 3
Robustness Analysis of Zero Knowledge Proofs using Diffie Hellman Problem
Sah, C. P. (2022) · International Conference on Technological Advancements in Computational Sciences (ICTACS) · doi:10.1109/ictacs56270.2022.9988299 · Cited by 3
A Proposal of Key Recovery Mechanism for Personal Decryptographic Keys
Sun, W., & Harayama, M. (2011) · International Conference on Internet Technology and Applications · doi:10.1109/itap.2011.6006112 · Cited by 3
Application of Commutative Rings with Unity for Construction of Symmetric Encryption System
Kryvyi, S. L. (2022) · Cybernetics and Systems Analysis · doi:10.1007/s10559-022-00464-z · Cited by 3
Fault Cryptanalysis of ElGamal Signature Scheme
Biernat, J., & Nikodem, M. (2005) · Lecture notes in computer science · doi:10.1007/11556985_43 · Cited by 3
ECC dynamic point encoding on mobile device
Kitbumrung, P., & Limthanmaphon, B. (2015) · doi:10.1109/icctim.2015.7224590 · Cited by 3
Randomized Approach for Block Cipher Encryption
Nagaraj, S., Raju, D. S. V. P., & Bhamidipati, K. (2012) · Advances in intelligent systems and computing · doi:10.1007/978-3-642-35314-7_62 · Cited by 3
A Comparative Analysis of Hybrid Encryption Schemes Based on Elliptic Curves
Martínez, V. G. (2013) · The Open Mathematics Journal · doi:10.2174/1874117701306010001 · Cited by 3
A New Security Scheme based on Palmprint Biometrics for Signature
Shi, R., & Sun, D. (2007) · IEEE International Conference on Biometrics: Theory, Applications and Systems (BTAS) · doi:10.1109/btas.2007.4401940 · Cited by 3
Using Maple Worksheets to Enable Student Explorations of Cryptography
J., M. M. S. (2009) · Cryptologia · doi:10.1080/01611190802323798 · Cited by 3
Using IFS as an Encryption Method
Al-Saidi, N. M. G., & Rushdan, M. S. (2009) · International Conference on Education Technology and Computer · doi:10.1109/icetc.2009.80 · Cited by 3
El‐Badawy, E. A., Emarah, A.-A. M., & El-Deen, A. E. T. (2006) · doi:10.1109/nrsc.2006.386355 · Cited by 3
Elkamchouchi, H. M. A., & Abouelseoud, Y. (2008) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces.2008.4773011 · Cited by 3
Non-interactive Deniable Authentication Protocol Using Generalized ECDSA Signature Scheme
Kar, J. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-23141-4_16 · Cited by 3
Secure Multilevel Cryptography Using Graceful Codes
Usha, G. (2012) · International Journal of Information and Electronics Engineering · doi:10.7763/ijiee.2012.v2.220 · Cited by 3
Quantum Computing for Discrete Logarithms
Yan, S. Y. (2015) · Springer eBooks · doi:10.1007/978-3-319-25823-2_4 · Cited by 3
A symmetric medical image encryption scheme based on irrational numbers
Manoharan, R. K., & Viswanath, M. K. (2018) · Biomedical Research - India · doi:10.4066/biomedicalresearch.29-17-1317 · Cited by 3
Methods of finding multiplicative inverses in GF(28)
Saeed, M., & Mian, M. S. (2008) · Computer Communications · doi:10.1016/j.comcom.2008.08.018 · Cited by 3
Lateral Movement in Undergraduate Research: Case Studies in Number Theory
Garcia, S. R. (2020) · Foundations for undergraduate research in mathematics · doi:10.1007/978-3-030-37853-0_7 · Cited by 2
Contributory approaches to centralized key agreement in dynamic peer groups
Saxena, A., & Soh, B. (2004) · doi:10.1109/icon.2003.1266223 · Cited by 3
An efficient undeniable group-oriented signature scheme
Chen, T., Chen, T., Huang, J.-Y., et al. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2004.04.043 · Cited by 3
A distributed key management protocol for dynamic groups
Lin, J.-C., Chou, C.-Y., Lai, F., et al. (2003) · Conference on Local Computer Networks · doi:10.1109/lcn.2002.1181773 · Cited by 3
Number-Theoretical Methods of Factoring Composite Numbers and Calculating the Discrete Logarithm
Semotiuk, M. V. (2022) · Cybernetics and Systems Analysis · doi:10.1007/s10559-022-00463-0 · Cited by 2
An improvised version of Hill’s cipher
Viswanath, M. K., & Deepti, A. R. (2008) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2008.10698180 · Cited by 2
Quantum Computing for Elliptic Curve Discrete Logarithms
Yan, S. Y. (2015) · Springer eBooks · doi:10.1007/978-3-319-25823-2_5 · Cited by 2
Robustness of Zero-Knowledge Proofs using RSA Problem
Sah, C. P. (2022) · International Conference on Computing for Sustainable Global Development · doi:10.23919/indiacom54597.2022.9763232 · Cited by 2
Symmetric Information Exchange System Based on Ring Isomorphism
Kryvyi, S. L., Opanasenko, V., Grinenko, E. A., et al. (2022) · Cybernetics and Systems Analysis · doi:10.1007/s10559-022-00500-y · Cited by 2
Novel Lossless Crypto-Compression Scheme for Medical Images
Matei, I.-E. (2024) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc65383.2024.00069 · Cited by 2
On the Complexity of Attacking Commercial Authentication Products
Kabin, I., Dyka, Z., Klann, D., et al. (2019) · IFIP International Conference on New Technologies, Mobility and Security (NTMS) · doi:10.1109/ntms.2019.8763782 · Cited by 2
A Secure Proxy Blind Signature Scheme Using ECC
Alghazzawi, D., Salim, T. M., & Hasan, S. H. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-22185-9_5 · Cited by 2
A Grid Authentication System with Revocation Guarantees
Sundaram, B., & Chapman, B. (2005) · Lecture notes in computer science · doi:10.1007/11602569_52 · Cited by 2
Factoring and Testing Primes in Small Space
Geffert, V., & Pardubská, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-540-95891-8_28 · Cited by 2
A Silent revolution in mathematics
Schuster, P. M. (2013) · Complexity · doi:10.1002/cplx.21464 · Cited by 2
Teodorescu, R. M., Lita, I., Cioc, I. B., et al. (2015) · International Conference on Electronics, Computers and Artificial Intelligence (ECAI) · doi:10.1109/ecai.2015.7301245 · Cited by 2
AN ELLIPTIC CURVE METRIC ON THE FUNDAMENTAL GROUP OVER $GF(2^5)$
Rishivarman, A. R., & Parthasarathy, B. (2013) · International Journal of Pure and Apllied Mathematics · doi:10.12732/ijpam.v89i4.8 · Cited by 2
PRACTICAL DEPLOYMENT OF ONE-PASS KEY ESTABLISHMENT PROTOCOL ON WIRELESS SENSOR NETWORKS
Mishra, M. R., Kar, J., & Majhi, B. (2015) · International Journal of Pure and Apllied Mathematics · doi:10.12732/ijpam.v100i4.12 · Cited by 2
Provably Secure Proxy Multi-Signature Scheme Based on ECC
Tiwari, N., Padhye, S., & He, D. (2014) · Information Technology And Control · doi:10.5755/j01.itc.43.2.5377 · Cited by 2
Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing
Shirase, M. (2011) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e94.a.156 · Cited by 2
Factoring and testing primes in small space
Geffert, V., & Pardubská, D. (2013) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2013038 · Cited by 2
Moldovyan, N. A. (2008) · Automation and Remote Control · doi:10.1134/s0005117908120114 · Cited by 2
Implementation and Analysis of a Novel Block Cipher
KiranReddy, M., & Kumar, K. (2014) · International Journal of Computer Applications · doi:10.5120/15525-4340 · Cited by 2
A Signing Message Architecture Development for Smart Card Chip Based on Open Sources
Kaaniche, W., & Masmoudi, M. (2008) · The Open Electrical & Electronic Engineering Journal · doi:10.2174/1874129000802010066 · Cited by 2
Comparison of cryptosystems using a single-scale statistical measure
Gonzalez, J. D. T., & Kinsner, W. (2013) · IEEE Canadian Conference on Electrical and Computer Engineering (CCECE) · doi:10.1109/ccece.2013.6567841 · Cited by 2
Study of Finite Field over Elliptic Curve: Arithmetic Means
Gajbhiye, S., Karmakar, S., & Sharma, M. (2012) · International Journal of Computer Applications · doi:10.5120/7283-0411 · Cited by 2
A survey of some applications of finite fields
Niederreiter, H. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0150-y · Cited by 2
Diffie-Hellman Key Agreement with Elliptic Curve Discrete Logarithm Problem
Gajbhiye, S., Karmakar, S., & Sharma, M. (2015) · International Journal of Computer Applications · doi:10.5120/ijca2015907030 · Cited by 2
Homomorphic Public Key Encryption Techniques
Lu, R. (2016) · Wireless networks · doi:10.1007/978-3-319-32899-7_2 · Cited by 2
Periodic Orbits of Planar Integrable Birational Maps
Gálvez-Carrillo, I., & Mañosa, V. (2015) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-319-12328-8_2 · Cited by 2
ID-Based Deniable Authentication Protocol Suitable for Mobile Devices
Kar, J. (2012) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-30244-2_14 · Cited by 2
Low-energy key exchange for automation systems
Kreiser, D., Dyka, Z., Kabin, I., et al. (2018) · International Conference on Design & Technology of Integrated Systems in Nanoscale Era (DTIS) · doi:10.1109/dtis.2018.8368586 · Cited by 2
Yan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_7 · Cited by 2
Yan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_6 · Cited by 2
Providing End-To-End Secure Communications in GSM Networks
Zouka, H. A. E. (2015) · International Journal of Network Security & Its Applications · doi:10.5121/ijnsa.2015.7402 · Cited by 2
Web Authentication Protocol Using Zero Knowledge Proof
Thiruvaazhi, U., & Divya, R. (2011) · Information Security Journal A Global Perspective · doi:10.1080/19393555.2011.560925 · Cited by 2
Computational Number Theory and Cryptography
Mihăilescu, P., & Rassias, M. T. (2014) · Springer optimization and its applications · doi:10.1007/978-3-319-04720-1_22 · Cited by 2
Design and Implementation of a Secure Communication Protocol
Viswanath, M. K., & Kumar, M. R. (2018) · International Journal of Electrical and Computer Engineering (IJECE) · doi:10.11591/ijece.v8i3.pp1814-1821 · Cited by 2
The Ubiquity of Elliptic Curves
Goins, E. H. (2019) · Notices of the American Mathematical Society · doi:10.1090/noti1789 · Cited by 2
COVID-19 paediatric cavity telecare system: a novel chain key generation and encryption scheme
Dey, J. (2022) · International Journal of Reconfigurable and Embedded Systems (IJRES) · doi:10.11591/ijres.v11.i1.pp13-24 · Cited by 2
Bisseling, R. H. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780198788348.003.0005 · Cited by 3
Elliptic Curves and Cryptography
Vazquez, S. R. (2010) · doi:10.31979/etd.6fat-tnvm · Cited by 2
Number Theory and Cryptography (using Maple)
Cosgrave, J. B. (2000) · Springer eBooks · doi:10.1007/978-3-642-59663-6_7 · Cited by 2
Cryptographic Commitment and Simultaneous ExchangePreprint
Bardsley, P., Clausen, A. P., & Teague, V. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.1153162 · Cited by 2
Cryptography, Trusted Third Parties and Escrow
Phoenix, S. J. D. (1998) · Springer eBooks · doi:10.1007/978-94-011-4918-1_5 · Cited by 2
Enhancing RSA with Random Insertion Method: A New Approach to Secure Cryptography
Durai, R. S. R., Hwang, S.-G., Kumar, A., et al. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-85363-0_26 · Cited by 1
Katyshev, S. Y., Karjuk, N. A., & Глухов, М. М. (2026) · Дискретная математика · doi:10.4213/dm1910 · Cited by 1
Implementation of GCD Attack with Projective Coordinates on Demytko’s Cryptosystem
Anuradha, P., & Praveen, L. V. (2015) · International Journal of Computer Applications · doi:10.5120/ijca2015905513 · Cited by 1
Dini, P., Signoretti, F. M., & Cusani, R. (2005) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs.2005.1547807 · Cited by 1
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