A note on cyclic groups, finite fields, and the discrete logarithm problem
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.
- A note on discrete logarithms in finite fields
- The discrete logarithm problem in some groups
- On the discrete logarithm problem in finite fields of fixed characteristic
- scientific article; zbMATH DE number 4130491
- Discrete logarithms for finite groups
- On the discrete logarithm problem in class groups of curves
- The discrete logarithm problem in the group of non-singular circulant matrices
- scientific article; zbMATH DE number 7310271
- ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION
- scientific article; zbMATH DE number 503246
- A key-exchange system based on imaginary quadratic fields
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Approximate formulas for some functions of prime numbers
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Elliptic Curve Cryptosystems
- Elliptic Curves
- Fast evaluation of logarithms in fields of characteristic two
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- Hyperelliptic cryptosystems
- New directions in cryptography
- Reducing elliptic curve logarithms to logarithms in a finite field
- Primality tests, linear recurrent sequences and the Pell equation
- Pell hyperbolas in DLP-based cryptosystems
- Algebraic cryptanalysis and new security enhancements
- Group law on affine conics and applications to cryptography
- Discrete logarithms for finite groups
- A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
- scientific article; zbMATH DE number 2145147 (Why is no real title available?)
- scientific article; zbMATH DE number 1409225 (Why is no real title available?)
- A Tale of Two Cyclicities: Counting in Finite Cyclic Groups and Finite Fields
- scientific article; zbMATH DE number 7310214 (Why is no real title available?)
- О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
- On the cubic Pell equation over finite fields
- On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r])\)
- DLP-based cryptosystems with Pell cubics
- Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
- The group factorization problem in finite groups of Lie type
- Cryptanalysis of a key exchange scheme based on block matrices
- Guest editorial: Special issue in honor of Scott A. Vanstone
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
This page was built for publication: A note on cyclic groups, finite fields, and the discrete logarithm problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196516)
