The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Discrete logarithms in finite fields and their cryptographic significance
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 2×
“T. ElGamal [ 26 ] has also proposed a novel signature scheme that uses exponentiation in fields GF(p), p”
MethodShift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
Asymptotic methods in analysis
de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Solution of systems of linear equations by minimized iterations
Lanczos, C. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.006 · Cited by 929
The Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825 · cited 3×
“Merkle [46], and Pollard [ 52 ], and its computational complexity was partially analyzed by Adleman [1].”
BackgroundMethodInfluentialSpecial Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Solving sparse linear equations over finite fields
Wiedemann, D. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057137 · Cited by 546
Secrecy, authentication, and public key systems
Merkle, R. C. (1979) · Cited by 518
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 396
Monte Carlo Methods for Index Computation (mod p)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.2307/2006496 · Cited by 367
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
A new algorithm for factoring polynomials over finite fields
Cantor, D. G., & Zassenhaus, H. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0606517-5 · Cited by 306
On Distinguishing Prime Numbers from Composite Numbers
Adleman, L. M., Pomerance, C., & Rumely, R. S. (1983) · The Annals of Mathematics · doi:10.2307/2006975 · Cited by 305
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 297
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
Adleman, L. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.2 · Cited by 242
On the Asymptotic Complexity of Matrix Multiplication
Coppersmith, D., & Winograd, S. (1982) · SIAM Journal on Computing · doi:10.1137/0211038 · Cited by 209
A New Implementation of Sparse Gaussian Elimination
Schreiber, R. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/356004.356006 · Cited by 199
On primitive trinomials (Mod 2)
Zierler, N., & Brillhart, J. D. (1968) · Information and Control · doi:10.1016/s0019-9958(68)90973-x · Cited by 148
A high security log-in procedure
Purdy, G. (1974) · Communications of the ACM · doi:10.1145/361082.361089 · Cited by 142
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Brillhart, J. D., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., & Wagstaff, S. S. (1988) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/022 · Cited by 139
A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography
Brickell, E. F. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_5 · Cited by 112
An efficient signature scheme based on quadratic equations
Ong, H., Schnorr, C. P., & Adi Shamir, Z. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808683 · Cited by 82
Discrete Logarithms and Factoring
Bach, E. (1984) · UC Berkeley · Cited by 77
Computing Logarithms in Finite Fields of Characteristic Two
Blake, I. F., Fuji‐Hara, R., Mullin, R. C., & Vanstone, S. A. (1984) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0605029 · Cited by 72
A Monte Carlo Factoring Algorithm With Linear Storage
Schnorr, C. P., & Lenstra, H. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0744939-5 · Cited by 70
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
ElGamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057075 · Cited by 55
Fast Computation of Discrete Logarithms in GF (q)
Hellman, M. E., & Reyneri, J. M. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_1 · Cited by 37
On Factorisation, with a Suggested New Approach
Miller, J. C. P. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0366796-6 · Cited by 15
Status report on factoring (at the Sandia National Labs)
Davis, J. A., Holdridge, D. B., & Simmons, G. J. (1985) · Theory and Application of Cryptographic Techniques · Cited by 9
Cited by
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
“…logarithms and factoring integers (which is the function used in some of the existing systems such as the RSA system [9]) is given by (see [1], [5], [10]) ) , where the best estimate for c is c = 0.69 for factoring integers (due to Schnorr and Lenstra [10]), as well as for discrete logarithms…”
BackgroundMethodInfluentialKoblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
Encrypted key exchange: password-based protocols secure against dictionary attacks
Bellovin, S. M., & Merritt, M. (2003) · Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213269 · Cited by 1,353
Metadata
- Authors
- Odlyzko, A. M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-02-28
- Pages
- 224-314
- OpenAlex
- W1490994218
- Cited by
- 367
- References
- 38
- FWCI
- 14.06
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.