| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401168 | Journal of Symbolic Computation | 2014 | 13 Pages |
Abstract
The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x3≡y2z(modp), where p is a given prime number. A nontrivial solution must also satisfy x3≠y2zx3≠y2z and 1⩽x,y1⩽x,y, z
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Srinivas Vivek, C.E. Veni Madhavan,