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 301–400 of 573
Curves, Codes and Cryptography
Blake, I. F. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5121-8_6 · Cited by 1
An ML estimation based robust Chinese remainder theorem for reals
Wang, W., Li, X., & Xia, X. (2015) · IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP) · doi:10.1109/chinasip.2015.7230425 · Cited by 1
Modular Integer Arithmetic for Public Key Cryptography
Güneysu, T. E., & Paar, C. (2009) · Integrated circuits and systems · doi:10.1007/978-0-387-71829-3_1 · Cited by 1
A New Substitution Block Cipher Using Genetic Algorithm
Nagaraj, S., Raju, D. S. V. P., & Bhamidipati, K. (2012) · Advances in intelligent systems and computing · doi:10.1007/978-3-642-35314-7_39 · Cited by 1
Fast parallel bio-molecular logic computing algorithms of discrete logarithm
Ho, M. S.-H., & Shih, Y.-Y. (2008) · IEEE International Conference on Bioinformatics and Bioengineering (BIBE) · doi:10.1109/bibe.2008.4696660 · Cited by 1
Elliptic Curve Scalar Multiplication with a Bijective Transform
Nagai, Y., Shirase, M., & Izu, T. (2014) · International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS) · doi:10.1109/imis.2014.35 · Cited by 1
Coset intersection of irreducible plane cubics
Korchmáros, G., & Pace, N. (2013) · Designs Codes and Cryptography · doi:10.1007/s10623-013-9806-7 · Cited by 1
A one-way function from thermodynamics and applications to cryptography
Hungerbühler, N., & Struwe, M. (2003) · Elemente der Mathematik · doi:10.1007/s000170300008 · Cited by 1
(2,1)-Lagged Fibonacci Generators Using Elliptic Curves over Finite Fields
Shankar, B. R., & Karuna, K. K. (2009) · International Conference on Computer Engineering and Technology · doi:10.1109/iccet.2009.103 · Cited by 1
Simulated Cryptography Algorithm for Enhanced Security of Cloud Data
KumarDash, S., & Panigrahy, C. (2015) · International Journal of Computer Applications · doi:10.5120/19262-0953 · Cited by 1
An analysis of efficient formulas for elliptic curve point addition over binary extension fields
Leinweber, L., Papachristou, C., & Wolff, F. (2011) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2011.5766253 · Cited by 1
Elliptic-Curve Point-Multiplication over GF(2163)
Deschamps, J., & Sutter, G. D. (2008) · Southern Conference on Programmable Logic (SPL) · doi:10.1109/spl.2008.4547727 · Cited by 1
ON CENTRALISERS AND NORMALISERS FOR GROUPS
Širola, B. (2012) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972712000548 · Cited by 1
A Method for Recovering a Key in the Key Exchange Cryptosystem by Diophantine Equations
AnuradhaKameswari, P., & Kumar, L. (2014) · International Journal of Computer Applications · doi:10.5120/17592-8302 · Cited by 1
On the Use of Gaussian Integers in Public Key Cryptosystems
Paul, A., Datta, S., Sharma, S., & Majumder, S. (2015) · Smart innovation, systems and technologies · doi:10.1007/978-81-322-2529-4_30 · Cited by 1
Factoring Cryptosystem Moduli when the Co-Factors Difference is Bounded
Akchiche, O., & Khadir, O. (2013) · International Journal of Information Technology Modeling and Computing · doi:10.5121/ijitmc.2013.1301 · Cited by 1
Cryptology Transmitted Message Protection
Izmaǐlov, I. A., Пойзнер, Б. Н., Romanov, I., et al. (2016) · Signals and communication technology · doi:10.1007/978-3-319-30125-9 · Cited by 1
Encode-then-Encrypt: A Novel Framework for Reliable and Secure Communication
Singh, R., Kumar, C. P., & Selvakumar, R. (2019) · Trends in mathematics · doi:10.1007/978-3-030-01123-9_58 · Cited by 1
Block Cipher Based Cryptographic Algorithm For Data Security
Hasan, S. H., Trigui, M. S., & Alquraishee, A. G. A. (2014) · INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY · doi:10.24297/ijmit.v8i3.1978 · Cited by 1
Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)
He, T.-X., Shiue, P. J.-S., & Chang, Y. (2020) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2019.1662580 · Cited by 1
Definition and Implementation of an Elliptic Curve Cryptosystem using a New Message Mapping Scheme
Lahraoui, Y., Youssef, A., & Lazaar, S. (2020) · International Conference on Networking, Information Systems & Security (NISS) · doi:10.1145/3386723.3387893 · Cited by 1
THE AVERAGE COMPLEXITY OF THE PROBABILISTIC ALGORITHM FOR FINDING PRIMITIVE ROOTS MODULO n
Adamski, T. (2014) · National Security Studies · doi:10.37055/sbn/135234 · Cited by 1
LISTEGA : List-Based STEGANOGRAPHY METHODOLOGY
Desoky, A. (2012) · Auerbach Publications eBooks · doi:10.1201/b11575-16 · Cited by 1
A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm
Elumalai, R., & Anjaneyulu, G. S. G. N. (2022) · Symmetry · doi:10.3390/sym14112443 · Cited by 1
Shaping Postquantum Cryptography: The Hidden Subgroup and Shift Problems
Dooms, A., Emerencia, C., & Lemmens, A. (2022) · IEEE BITS the Information Theory Magazine · doi:10.1109/mbits.2023.3275885 · Cited by 1
Mihăilescu, M. I., & Niță, Ș. L. (2023) · Apress eBooks · doi:10.1007/978-1-4842-9450-5_2 · Cited by 1
Determination of Common Remainder from Its Redundancy Residual Set
Li, X., Shen, Z., Jia, Y., et al. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-2757-5_48 · Cited by 1
Quantum Communication and Quantum Cryptography
Simon, D. S. (2025) · Undergraduate texts in physics · doi:10.1007/978-3-031-81315-3_18 · Cited by 1
Blockchain-based anonymous and self-tallying voting with time-bounded ballot secrecy
Shi, Y., Fan, K., Bai, Y., Zhang, C., Zhang, K., Li, H., & Yang, Y. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111217 · Cited by 1
Solvability and Nilpotency of Lie Algebras in Cryptography and Steganography
Hasić, A., Azizović, M., Azizović, E., & Saracevic, M. H. (2025) · Mathematics · doi:10.3390/math13111824 · Cited by 2
Privacy-Aware Processing of Biometric Templates by Means of Secure Two-Party Computation
Lazzeretti, R., Failla, P., & Barni, M. (2013) · Springer eBooks · doi:10.1007/978-1-4471-5230-9_7 · Cited by 1
Effective Oblivious Transfer Using a Probabilistic Encryption
Frolov, A. (2012) · Advances in intelligent and soft computing · doi:10.1007/978-3-642-30662-4_9 · Cited by 1
A New Stream Cipher Using Natural Numbers Based on Conventional Encryption Techniques: MINNSC
Hegadi, R. S. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-22191-0_37 · Cited by 1
Quantum Attacks on ECDLP-Based Cryptosystems
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9_4 · Cited by 1
ALGORITMOS PARA PRUEBAS DE PRIMALIDAD
Martínez, R., Ortiz, L. A. C., Horna, J., et al. (2014) · Selecciones Matemáticas · doi:10.17268/sel.mat.2014.02.04 · Cited by 1
Improving of Non-Interactive Zero-Knowledge Arguments Using Oblivious Transfer
Frolov, A. (2013) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-00945-2_14 · Cited by 1
Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decomposition Method
Sundarayya, P., & Prasad, M. G. V. (2017) · International Journal of Trend in Scientific Research and Development · doi:10.31142/ijtsrd90 · Cited by 1
Nongkynrih, A. (2003) · Hindustan Book Agency · doi:10.1007/978-93-86279-15-6_22 · Cited by 1
The duality principle in the theory of development generalized A-M knapsack cryptosystems
Osipyan, V. O., Tlusten, V. S., Laktionova, N. V., et al. (2017) · International Conference on Security of Information and Networks (SIN) · doi:10.1145/3136825.3136898 · Cited by 1
Analysis of the RSA-cryptosystem in abstract number rings
Kondratyonok, N. (2020) · Journal of the Belarusian State University Mathematics and Informatics · doi:10.33581/2520-6508-2020-1-13-21 · Cited by 1
Elliptic Curves in Modern Cryptographic Systems
Andrii, S. (2020) · International Journal of Advanced Trends in Computer Science and Engineering · doi:10.30534/ijatcse/2020/259942020 · Cited by 1
A Decentralized Weighted Vote Traffic Congestion Detection Framework for ITS
Song, Y., Wang, Z., Zhang, J., et al. (2020) · Communications in computer and information science · doi:10.1007/978-981-15-9129-7_18 · Cited by 1
On the Complexity of Attacking Commercial Authentication Products
Kabin, I., Dyka, Z., Klann, D., Schaeffner, J., & Langendöerfer, P. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103480 · Cited by 1
Specific Congruence Classes of Integer Parameters for Generating BLS Curves for Fast Pairings
Nanjo, Y., Shirase, M., Kusaka, T., et al. (2020) · International Symposium on Computing and Networking Workshops (CANDARW) · doi:10.1109/candarw51189.2020.00073 · Cited by 1
Quantum Attacks on DLP-Based Cryptosystems
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9_3 · Cited by 1
A Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata
Gonzalez, J. D. T., & Kinsner, W. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-2476-4.ch017 · Cited by 1
Lenze, B. (2020) · Springer eBooks · doi:10.1007/978-3-658-30028-9_17 · Cited by 1
Bisseling, R. H. (2020) · doi:10.1093/oso/9780198788348.003.0003 · Cited by 1
A Novel Approach of Symmetric Key Cryptography using Genetic Algorithm Implemented on GPGPU
Srinivasa, K. G., Siddesh, G. M., Hiriyannaiah, S., et al. (2019) · Cryptography · doi:10.4018/978-1-7998-1763-5.ch012 · Cited by 1
Firma electrónica habilitada por tarjetas inteligentes para fines de seguridad
Vite, O. D. L. C., Mora, F. B., & Gómez, A. M. P. (2022) · PÄDI Boletín Científico de Ciencias Básicas e Ingenierías del ICBI · doi:10.29057/icbi.v10i19.8583 · Cited by 1
Prabu, M. V., & Karthika, R. (2023) · AIP conference proceedings · doi:10.1063/5.0137777 · Cited by 1
Variations on a Miller–Rabin Theme
Ehme, J. (2023) · PRIMUS · doi:10.1080/10511970.2023.2237511 · Cited by 1
Cryptography as a Bridge to Abstract Mathematics
Wootton, A. (2023) · PRIMUS · doi:10.1080/10511970.2023.2242109 · Cited by 1
Cubic Curves over Finite Fields
Silverman, J. H., & Tate, J. (2015) · Undergraduate texts in mathematics · doi:10.1007/978-3-319-18588-0_4 · Cited by 1
Integer Factorization Based Cryptography
Yan, S. Y. (2012) · doi:10.1002/9781118188606.ch7 · Cited by 1
Discrete Logarithm Based Cryptography
Yan, S. Y. (2012) · Wiley eBooks · doi:10.1002/9781118188606.ch8 · Cited by 1
Modular Multiplication in GF(pk) Using Lagrange Representation
Bajard, J.-C., Imbert, L., & Négre, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36231-2_22 · Cited by 1
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography
Muralidhara, V. N., & Sen, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77026-8_5 · Cited by 1
Spectral Modular Arithmetic for Cryptography
Saldamli, G., & Koç, Ç. K. (2008) · Springer eBooks · doi:10.1007/978-0-387-71817-0_7 · Cited by 1
Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions
Chudý, M. (2009) · IFIP advances in information and communication technology · doi:10.1007/978-3-642-04802-9_9 · Cited by 1
Inversion in finite fields of characteristic 2 using logarithmic depth
Sergeev, I. S. (2007) · Moscow University Mathematics Bulletin · doi:10.3103/s0027132207010068 · Cited by 1
Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions
Lange, T., & Winterhof, A. (2001) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(04)00202-1 · Cited by 1
New algorithms and protocols for information authentication in automatic control systems
Moldovyan, A. A., & Moldovyan, N. A. (2008) · Automation and Remote Control · doi:10.1134/s0005117908070151 · Cited by 1
Pseudoirreducible Polynomials: Probabilistic Irreducibility Testing
Kovalchuk, L. (2004) · Cybernetics and Systems Analysis · doi:10.1023/b:casa.0000047882.56182.83 · Cited by 1
Guaranteeing the integrity of data by using a digital signature - [instrumentationnotes]
Yucht, E., Engelberg, S., & Cohen, B. (2009) · IEEE Instrumentation & Measurement Magazine · doi:10.1109/mim.2009.5270530 · Cited by 1
Experiments in Wireless Internet Security
Gupta, S., & Gupta, V. (2004) · Statistics, a series of textbooks and monographs · doi:10.1201/9781420030884.ch3 · Cited by 1
Hankerson, D., & Menezes, A. (2021) · Springer eBooks · doi:10.1007/978-3-642-27739-9_244-2 · Cited by 1
Schaefer, E. F. (2015) · American Mathematical Monthly · doi:10.4169/amer.math.monthly.122.01.83 · Cited by 1
Cox, D. A. (2007) · Wiley eBooks · doi:10.1002/9780470050118.ecse012 · Cited by 1
Fundamentals of Cryptography and Encryption
Gove, R. A. (2000) · Auerbach Publications eBooks · doi:10.1201/9780203325438.ch132 · Cited by 1
An Application of the Gauss Lemma to the Study of Pseudorandom Sequences Based on Quadratic Residues
Tarakanov, V. E. (2003) · Mathematical Notes · doi:10.1023/a:1023267406766
Applied Number Theory in Computing/Cryptography
Yan, S. Y. (2002) · Springer eBooks · doi:10.1007/978-3-662-04773-6_3
LOW COST ELLIPTIC CURVE SCALAR MULTIPLICATION FOR CONSTRAINED DEVICES
Kar, J. (2015) · International Journal of Pure and Apllied Mathematics · doi:10.12732/ijpam.v102i3.14
Leonesi, S., & Toffalori, C. (2006) · Unitext · doi:10.1007/88-470-0517-5_2
Elliptic Curve Discrete Logarithm Based Cryptography
Yan, S. Y. (2012) · Wiley eBooks · doi:10.1002/9781118188606.ch9
Leonesi, S., & Toffalori, C. (2006) · Unitext · doi:10.1007/88-470-0477-2_4
Ganapathy, G., & Mani, K. (2010) · Lecture notes in electrical engineering · doi:10.1007/978-90-481-9419-3_39
Computational/Algorithmic Number Theory
Yan, S. Y. (2002) · Springer eBooks · doi:10.1007/978-3-662-04773-6_2
Flip Flop and Double Substitution based Textual Encryption
Shrivishwanath, D. (2014) · Indian Journal of Science and Technology · doi:10.17485/ijst/2014/v7sp4.14
Algebraic Aspects of Number Theory
Adhikari, M. R., & Adhikari, A. (2013) · Springer eBooks · doi:10.1007/978-81-322-1599-8_10
Efficient Hardware Multiplicative Inverters
Kim, H., & Oh, H.-C. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36552-4_22
NISp1-01: A Countermeasure to Defend Against Relay Attacks in Wireless Networks
Tang, C., & Wu, D. O. (2006) · Globecom · doi:10.1109/glocom.2006.308
The design and evaluation of a cryptography teaching strategy for software engineering students
Dowling, T. (2006) · European Journal of Engineering Education · doi:10.1080/03043790600797434
New Series of Rational Approximations and Some of Their Applications
Tarakanov, V. E. (2004) · Mathematical Notes · doi:10.1023/b:matn.0000036760.37456.f9
Cryptosystem with Rédei Rational Functions via Pellconics
AnuradhaKameswari, P., & Kumari, R. C. (2012) · International Journal of Computer Applications · doi:10.5120/8639-2054
Kryptographie und elliptische Kurven
Meier, W., & Staffelbach, O. (1997) · Elemente der Mathematik · doi:10.1007/s000170050023
Elliptic Curves, Palindrome Numbers and Secret keys
KamathK, K., & Shankar, B. R. (2012) · International Journal of Computer Applications · doi:10.5120/6288-8477
Security of Nyberg-Rueppel digital signatures without message recovery
Adamski, T., & Nowakowski, W. (2014) · Bulletin of the Polish Academy of Sciences Technical Sciences · doi:10.2478/bpasts-2014-0090
Some Cryptographic Weakness and the Ways to Avoid Them in ICT Services of Developing Countries.
Hyka, D., & Benusi, A. (2014) · European Journal of Sustainable Development · doi:10.14207/ejsd.2014.v3n2p73
A quick exponentiation algorithm for 3 × 3 block upper triangular matrices
Álvarez, R., Gallardo, C., Vicent, J. F., et al. (2012) · Applied Mathematics and Computation · doi:10.1016/j.amc.2012.08.042
Fast group operations on elliptic curves in Maple
Yan, S. Y., & James, G. (1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)00106-6
Jormakka, J. (2007) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2007.10698128
Cramer–Damgård signatures revisited: Efficient flat-tree signatures based on factoring
Catalano, D., & Gennaro, R. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.10.029
The operation of the elliptic curve cryptology in IPv6
Lo, C.-Y. (2005) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2005.10698051
A Novel Password based Multi Party Key Agreement Protocol on Elliptic Curve
Alghazzawi, D. (2012) · International Journal of Computer Science and Information Technology · doi:10.5121/ijcsit.2012.4106
Implementing Multi-party Key Exchange by Linear Combination of Elliptic Curve Points
Yang, J., & Yang, X. (2008) · International Symposium on Electronic Commerce and Security · doi:10.1109/isecs.2008.209
Design and Implementation of Secure Stream Cipher based on Elliptic Curves on Time Shared Basis
SLalmohan, K., Deepthi, P. P., & Sathidevi, P. S. (2013) · International Journal of Computer Applications · doi:10.5120/11702-7276
R.SamEmmanuel, W. (2013) · International Journal of Computer Applications · doi:10.5120/9915-4514
Computing in the Jacobian of a $C_{34}$ curve
Soondug, K. I. M. (2004) · Tohoku Mathematical Publications · doi:10.2748/tmpub.30.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