CoChat

Discrete logarithms and local units

Schirokauer, Oliver · 1993 · Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences
Cited by 133

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Let K be a number field and (9K its ring of integers. Let l be a prime number and e a positive integer. We give a method to construct leth powers in (9K using smooth algebraic integers. This method makes use of approximations of the l-adic logarithm to identify leth powers. One version we give is successful if the class number of K is not divisible by l and if the units in CK which are congruent to 1 modulo le+1 are leth powers. A second version only depends on Leopoldt’s conjecture. We use the technique of constructing leth powers to find discrete logarithms in a finite field of prime order. Our method for computing discrete logarithms is closely modelled after Gordon’s adaptation of the number field sieve to this problem. We conjecture th at the expected running time of our algorithm is Lp[1/3; (64/9)1/3 + o(1)] for p-> oo, where Lp[s; c] = exp (c (log q)s (log log q)1-8). This is the same running time as is conjectured for the number field sieve factoring algorithm.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1098/rsta.1993.0139

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Factoring integers with the number field sieve

    Buhler, J. P., Lenstra, H. W., & Pomerance, C. (1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091539 · Cited by 188 · cited 1×

    “…to find the set M mentioned above and the use of powers in (9k to find a relation in Fp are based on ideas found in the number field sieve factoring algorithm (Buhler et al. 1993; Lenstra et al. 1993) and in Gordon’s adaptation of the number field sieve to the problem of discrete logarithms (1993).”

Show all 1 references

Cited by

See all 133

Metadata

Authors
Schirokauer, O.
Venue
Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences
Published
1993-11-15
Volume
345
Issue
1676
Pages
409-423
ISSN
  • 0962-8428 (ISSN-L)
  • 2054-0299
OpenAlex
W2020929171
Cited by
133
References
1
FWCI
9.02
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Discrete logarithms and local units. https://app.cochat.ai/papers/10.1098/rsta.1993.0139
The paper
Schirokauer, O. (1993). Discrete logarithms and local units. Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences. https://doi.org/10.1098/rsta.1993.0139

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.