Searching for "An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve." – sorted by Relevance.
-
On the list and bounded distance decodability of the Reed-Solomon codes
- algorithms to solve the discrete logarithm problem are the number field sieve and the function field sieve
- Cited by 12 (3 self) – Add To MetaCart
-
On the bounded sum-of-digits discrete logarithm problem in finite fields
- ′ in the subgroup. The general purpose algorithms to solve the discrete logarithm problem are the number field sieve
- Cited by 1 (0 self) – Add To MetaCart

