On the cubic sieve method for computing discrete logarithms over prime fields

DOI10.1080/120716031000120827zbMath1160.94384OpenAlexW2126923963MaRDI QIDQ5719250

Abhijit Das, C. E. Veni Madhavan

Publication date: 18 January 2006

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://eprints.iisc.ac.in/5754/1/av154.pdf

zbMATH Keywords

finite fieldcryptographysieve methodcryptanalysisdiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Primality (11Y11)

Related Items (2)

Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences ⋮ Discrete logarithm problem using index calculus method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Computation of discrete logarithms in prime fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve

This page was built for publication: On the cubic sieve method for computing discrete logarithms over prime fields