On the application of Wiener's parallel collision search method to discrete logarithmization on Edwards curves

zbMATH Open1274.14029MaRDI QIDQ2857776FDOQ2857776

Authors: F. A. Sinitsyn 

Publication date: 19 November 2013

Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/cheb205

Recommendations

• Improving the parallelized Pollard lambda search on anomalous binary curves
• Solving discrete logarithm problems faster with the aid of pre-computation
• scientific article; zbMATH DE number 2165762
• Fast Point Multiplication on Elliptic Curves without Precomputation
• Research on attacking a special elliptic curve discrete logarithm problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

This page was built for publication: On the application of Wiener's parallel collision search method to discrete logarithmization on Edwards curves

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