Keywords
Discrete logarithmLogarithmMathematicsDiscrete mathematicsPrime (order theory)Algebraic numberAlgorithmQuadratic residueFinite fieldBinary logarithmQuadratic equationCombinatoricsComputer sciencePublic-key cryptography
Affiliated Institutions
Related Publications
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
An algorithm for computing discrete logarithms over GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(p^{2})</tex> , where <tex ...
Fast evaluation of logarithms in fields of characteristic two
A method for determining logarithms in GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(2^{n})</tex> is presented. Its asymptot...
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
A cryptographic system is described which is secure if and only if computing logarithms over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1...
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time $L_n [1/3; c]$, where \[ L_n [ v ;c ] = \exp \left\{ ( c +...
Reducing elliptic curve logarithms to logarithms in a finite field
Elliptic curve cryptosystems have the potential to provide relatively small block size, high-security public key schemes that can be efficiently implemented. As with other known...
Publication Info
- Year
- 1984
- Type
- book-chapter
- Pages
- 275-292
- Citations
- 10
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
10
OpenAlex
Cite This
Taher ElGamal
(1984).
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2).
, 275-292.
https://doi.org/10.1007/978-1-4684-4730-9_22
Identifiers
- DOI
- 10.1007/978-1-4684-4730-9_22