A note on cyclic groups, finite fields, and the discrete logarithm problem

DOI10.1007/BF01189025zbMath0749.11056MaRDI QIDQ1196516

Alfred J. Menezes, Scott A. Vanstone

Publication date: 14 December 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

finite fieldcryptographyelliptic curvecyclic subgroupsdiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52)

Related Items

Guest editorial: Special issue in honor of Scott A. Vanstone, Algebraic cryptanalysis and new security enhancements, 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, A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups, The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups, Group law on affine conics and applications to cryptography, Cryptanalysis of a key exchange scheme based on block matrices, Primality tests, linear recurrent sequences and the Pell equation, Pell hyperbolas in DLP-based cryptosystems, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithms in \(\mathrm{GF}(p)\)
• A key-exchange system based on imaginary quadratic fields
• Hyperelliptic cryptosystems
• Approximate formulas for some functions of prime numbers
• Fast evaluation of logarithms in fields of characteristic two
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Reducing elliptic curve logarithms to logarithms in a finite field
• Elliptic Curves