On an probabilistic algorithm solving discrete logarithm problem

MaRDI QIDQ4912343zbMATH OpenFDO

Authors Murat Sahin, Ali Bulent Ekin

Publication date 3 April 2013

zbMATH Keywords

collision detection algorithmdiscrete logarithm problemPollard's rho algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Accelerating Pollard's rho algorithm on finite fields
• Public Key Cryptography - PKC 2006
• On the discrete logarithm problem in finite fields of fixed characteristic
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields

Cited in

(2)

• Accelerating Pollard's rho algorithm on finite fields
• Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications

This page was built for publication: On an probabilistic algorithm solving discrete logarithm problem

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