A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Scott A. Vanstone / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Ian F. Blake / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A key-exchange system based on imaginary quadratic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of logarithms in fields of characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms in \(\mathrm{GF}(p)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperelliptic cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank

Latest revision as of 13:51, 16 May 2024

scientific article
Language Label Description Also known as
English
A note on cyclic groups, finite fields, and the discrete logarithm problem
scientific article

    Statements

    A note on cyclic groups, finite fields, and the discrete logarithm problem (English)
    0 references
    0 references
    0 references
    14 December 1992
    0 references
    Let \(F_ q\) denote the finite field of order \(q\) and \(E(F_ q)\) and elliptic curve over \(F_ q\). Previous work showed how the discrete logarithm problem in the additive group of \(E(F_ q)\) can be reduced to the discrete logarithm problem in \(F_{q^ k}\) for some integer \(k\) in the case \(gcd(\# E(F_ q),q)=1\). It is shown here how the logarithm problem in the curve of the Pell equation \(x^ 2-Dy^ 2=1\) can be reduced to the logarithm problem \(F_ q\) or \(F_{q^ 2}\), \(q\) odd. It is also shown that the logarithm problem in certain cyclic subgroups of \(GL(n,q)\), the group of nonsingular \(n\times n\) matrices over \(F_ q\), can be reduced to the logarithm problem in an extension of \(F_ q\). The results indicate the group \(G\) must be carefully chosen for cryptographic purposes.
    0 references
    cryptography
    0 references
    finite field
    0 references
    elliptic curve
    0 references
    discrete logarithm
    0 references
    cyclic subgroups
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references