The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Abstract
The aim of this paper is to show that the computation of the discrete logarithm in the m-torsion part of the divisor class group of a curve X over a finite field ko (with char(ko) prime to m), or over a local field k with residue field ko, can be reduced to the computation of the discrete logarithm in k0(4m)* . For this purpose we use a variant of the (tame) Tate pairing for Abelian varieties over local fields. In the same way the problem to determine all linear combinations of a finite set of elements in the divisor class group of a curve over k or ko which are divisible by m is reduced to the computation of the discrete logarithm in ko(Cm)* -
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
Koblitz, N. (1989) · Journal of Cryptology · doi:10.1007/bf02252872 · Cited by 455
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
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A., Vanstone, S., & Okamoto, T. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103434 · Cited by 337
$WC$-groups over $p$-adic fields
Tate, J. (1958) · French digital mathematics library (Numdam) · Cited by 64
Elliptic curves and cryptography : a pseudorandom bit generator and other tools
Kaliski, B. S. (1988) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 32
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
jPBC: Java pairing based cryptography
De Caro, A., & Iovino, V. (2011) · 2011 IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2011.5983948 · Cited by 703
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
The Weil Pairing, and Its Efficient Calculation
Miller, V. S. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0315-8 · Cited by 578
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
An Efficient Protocol for Authenticated Key Agreement
Law, L., Menezes, A., Qu, M., Solinas, J., & Vanstone, S. (2003) · Designs, Codes and Cryptography · doi:10.1023/a:1022595222606 · Cited by 513
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
A Taxonomy of Pairing-Friendly Elliptic Curves
Freeman, D., Scott, M., & Teske, E. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9048-z · Cited by 466
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0312-y · Cited by 452
Applications of multilinear forms to cryptography
Boneh, D., & Silverberg, A. (2003) · Contemporary Mathematics · doi:10.1090/conm/324/05731 · Cited by 395
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Gallant, R. P., Lambert, R. J., & Vanstone, S. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_11 · Cited by 376
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
Cohen, H., Miyaji, A., & Ono, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49649-1_6 · Cited by 296
Metadata
- Authors
- Frey, G., & Ruck, H.-G.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1994-04
- Volume
- 62
- Issue
- 206
- Pages
- 865
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2094556471
- Cited by
- 551
- References
- 5
- FWCI
- 1.18
- 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.