## A SHORT NOTE ON DISCRETE LOG PROBLEM IN F ∗ p

### BibTeX

@MISC{Syed_ashort,

author = {Habeeb Syed},

title = {A SHORT NOTE ON DISCRETE LOG PROBLEM IN F ∗ p},

year = {}

}

### OpenURL

### Abstract

Abstract. Let p be a odd prime such that 2 is a primitive element of finite field Fp. In this short note we propose a new algorithm for the computation of discrete logarithm in F ∗ p.

### Citations

2903 | New directions in cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ...oblem (DLP) in F ∗ q. Discrete log computation in finite fields is an important problem mainly due to applications of these groups in cryptography. Beginning with Diffie-Hellman key exchange protocol =-=[3]-=-, El ElGamal encryption/signature scheme [4] the DLP in F ∗ q has been used as basic mathematical primitive in many cryptographic schemes, and security of these systems depend on difficulty of DLP in ... |

332 |
A public key cryptosystem and a signature scheme based on discrete logarithms
- Gamal
- 1985
(Show Context)
Citation Context ...on in finite fields is an important problem mainly due to applications of these groups in cryptography. Beginning with Diffie-Hellman key exchange protocol [3], El ElGamal encryption/signature scheme =-=[4]-=- the DLP in F ∗ q has been used as basic mathematical primitive in many cryptographic schemes, and security of these systems depend on difficulty of DLP in respective F ∗ q. It is rather difficult to ... |

305 |
Reducing Elliptic Curves Logarithms to Logarithms in a Finite Field
- Menezes, Okamoto, et al.
- 1993
(Show Context)
Citation Context ..., and security of these systems depend on difficulty of DLP in respective F ∗ q. It is rather difficult to give even reasonably good list of references to all the work involving DLP in F ∗ q, however =-=[8, 6]-=- are good to begin with. In the last couple of decades DLP in F ∗ q has been studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the co... |

91 | Discrete Logarithms in finite fields and their cryptographic significance
- Odlyzko
- 1984
(Show Context)
Citation Context ..., and security of these systems depend on difficulty of DLP in respective F ∗ q. It is rather difficult to give even reasonably good list of references to all the work involving DLP in F ∗ q, however =-=[8, 6]-=- are good to begin with. In the last couple of decades DLP in F ∗ q has been studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the co... |

67 | Discrete logarithms in GF(p) using the number field sieve
- Gordon
- 1993
(Show Context)
Citation Context ...LP in F ∗ q has been studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the computation of DLP is the one based on Number Field Sieve =-=[5, 9]-=-. See also [2, 7] for results which are not computationally oriented but certainly give insight into the problem of DLP in F ∗ q. In this short note we are focused on odd primes p for which 2 is primi... |

34 | A Concise Introduction to the Theory of Numbers - Baker - 1984 |

31 |
On polynomial approximation of the Discrete Logarithm and the Diffie-Hellman mapping
- Coppersmith, Shparlinski
(Show Context)
Citation Context ...een studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the computation of DLP is the one based on Number Field Sieve [5, 9]. See also =-=[2, 7]-=- for results which are not computationally oriented but certainly give insight into the problem of DLP in F ∗ q. In this short note we are focused on odd primes p for which 2 is primitive element of F... |

13 | Using number fields to compute logarithms in finite fields
- Schirokauer
(Show Context)
Citation Context ...LP in F ∗ q has been studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the computation of DLP is the one based on Number Field Sieve =-=[5, 9]-=-. See also [2, 7] for results which are not computationally oriented but certainly give insight into the problem of DLP in F ∗ q. In this short note we are focused on odd primes p for which 2 is primi... |

10 |
A polynomial representation for logarithms in GF(q
- Mullen, White
- 1992
(Show Context)
Citation Context ...een studied extensively and several algorithms have been proposed for the computation same. Most efficient algorithm for the computation of DLP is the one based on Number Field Sieve [5, 9]. See also =-=[2, 7]-=- for results which are not computationally oriented but certainly give insight into the problem of DLP in F ∗ q. In this short note we are focused on odd primes p for which 2 is primitive element of F... |