scientific article; zbMATH DE number 2165762

MaRDI QIDQ4675703zbMATH OpenFDO

Authors Junquan Li, Mu-Lan Liu

Publication date 6 May 2005

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Cryptography (94A60)

Recommendations

• Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
• Accelerating Pollard's rho algorithm on finite fields
• Improving the parallelized Pollard lambda search on anomalous binary curves

Cited in

(9)

• Computing discrete logarithms with the parallelized kangaroo method.
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order
• On the application of Wiener's parallel collision search method to discrete logarithmization on Edwards curves
• Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
• Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
• Accelerating Pollard's rho algorithm on finite fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• An iterative method based on Pohlig-Hellman and Pollard for computing discrete logarithm

This page was built for publication:

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