The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Fast evaluation of logarithms in fields of characteristic two
Abstract
A method for determining logarithms in GF(2^{n})is presented. Its asymptotic running time isO(\exp (cn^{1/3} \log^{2/3} n))for a small constantc, while, by comparison, Adleman's scheme runs in timeO(\exp (c^{'}n^{1/2} \log^{1/2} n )). The ideas give a dramatic improvement even for moderate-sized fields such as GF(2^{127}), and make (barely) possible computations in fields of size around2^{400}. The method is not applicable to GF(q)for a large primeq.
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
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 Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Factoring Polynomials Over Finite Fields
Berlekamp, E. R. (1967) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1967.tb03174.x · Cited by 317
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
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
Self-citationA method of factoring and the factorization of 𝐹₇
Morrison, M. A., & Brillhart, J. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0371800-5 · Cited by 170
A Method of Factoring and the Factorization of F 7
Morrison, M. A., & Brillhart, J. D. (1975) · Mathematics of Computation · doi:10.2307/2005475 · Cited by 99
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
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
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
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
Metadata
- Authors
- Coppersmith, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1984-07
- Volume
- 30
- Issue
- 4
- Pages
- 587-594
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2091260227
- Cited by
- 297
- References
- 15
- FWCI
- 29.29
- Type
- journal article
- 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.