Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

Authors:
Srinivas Vivek;C. E. Veni Madhavan
Affiliations:
University of Luxembourg, Luxembourg;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
Journal of Symbolic Computation
Year:
2014

Citing 4
Cited 0

Discrete logarithms in GF(p)

Algorithmica
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Discrete Logarithms: The Effectiveness of the Index Calculus Method

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x^3=y^2z(modp), where p is a given prime number. A nontrivial solution must also satisfy x^3y^2z and 1=