scientific article; zbMATH DE number 6488034

zbMATH Open1344.11083MaRDI QIDQ2949487FDOQ2949487

Authors: Daniel J. Bernstein, Tanja Lange 

Publication date: 1 October 2015

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

complexitydiscrete logarithmsPollard rhobaby-step giant-step

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

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
• Improving ECDLP computation in characteristic 2
• Recent progress on the elliptic curve discrete logarithm problem
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• CryptAttackTester: high-assurance attack analysis
• Improved algorithm for the isogeny problem for ordinary elliptic curves
• 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)