scientific article; zbMATH DE number 6488034

MaRDI QIDQ2949487zbMATH OpenFDO

Authors Daniel J. Bernstein, Tanja Lange

Publication date 1 October 2015

zbMATH Keywords

complexitydiscrete logarithmsPollard rhobaby-step giant-step

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Presenting the Baby Monster
• Giants on deformed backgrounds
• Two Giants from St. Petersburg
• Two ways to scare a Gruffalo
• Giants
• SUSY and Goliath

Cited in

(17)

• Solving discrete logarithm problems faster with the aid of pre-computation
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• Recent progress on the elliptic curve discrete logarithm problem
• Improving ECDLP computation in characteristic 2
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Asymptotic analysis of sums of powers of multinomial coefficients: a saddle point approach
• On random walks for Pollard's rho method
• scientific article; zbMATH DE number 2086902 (Why is no real title available?)
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• scientific article; zbMATH DE number 1643924 (Why is no real title available?)
• Baby-step giant-step algorithms for the symmetric group
• On the multi-user security of short Schnorr signatures with preprocessing
• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• CryptAttackTester: high-assurance attack analysis
• Baby-step giant-step algorithms for the symmetric group
• Square-root algorithms for the discrete logarithm problem (a survey)

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 Q2949487)