Performance analysis of index calculus method

DOI10.1080/09720529.2009.10698242MaRDI QIDQ3561529zbMATH OpenOpenAlexFDO

Authors R. Padmavathy, Chakravarthy Bhagvati

Publication date 25 May 2010

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2009.10698242

zbMATH Keywords

discrete logarithm problemindex calculus methodrandom method

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Discrete logarithm problem using index calculus method
• The index calculus method using non-smooth polynomials
• On the Discrete Logarithm Problem on Algebraic Tori
• scientific article; zbMATH DE number 1113850
• On index calculus algorithms for subfield curves

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1461529 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Approximating the number of integers free of large prime factors
• Computation of discrete logarithms in prime fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Discrete logarithms: The past and the future
• Monte Carlo Methods for Index Computation (mod p)
• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)

Cited in

(1)

• Discrete logarithm problem using index calculus method

This page was built for publication: Performance analysis of index calculus method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561529)