Computational hardness of IFP and ECDLP

DOI10.1007/S00200-016-0291-XMaRDI QIDQ505664zbMATH OpenOpenAlexFDO

Authors Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu

Publication date 26 January 2017

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-016-0291-x

zbMATH Keywords

IFPnumber field sieveelliptic curve discrete logarithm problem (ECDLP)Pollard's rho method

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Primality (11Y11)

Recommendations

• On the strength comparison of the ECDLP and the IFP
• The state of elliptic curve cryptography
• scientific article; zbMATH DE number 3948147
• scientific article; zbMATH DE number 1440074
• Quantum attacks on public-key cryptosystems

Cites work

• scientific article; zbMATH DE number 1186971 (Why is no real title available?)
• scientific article; zbMATH DE number 1221897 (Why is no real title available?)
• scientific article; zbMATH DE number 1304118 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 475432 (Why is no real title available?)
• scientific article; zbMATH DE number 1504795 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A Kilobit Special Number Field Sieve Factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• Cryptanalysis with COPACOBANA
• ECC2K-130 on NVIDIA GPUs
• Elliptic Curve Cryptosystems
• Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
• Factorization of a 768-Bit RSA Modulus
• Factorization of the Eighth Fermat Number
• Improving the complexity of index calculus algorithms in elliptic curves over binary fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Mathematics of public key cryptography.
• Monte Carlo Methods for Index Computation (mod p)
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On random walks for Pollard's rho method
• On random walks of Pollard's rho method for the ECDLP on Koblitz curves
• On the correct use of the negation map in the Pollard rho method
• On the strength comparison of the ECDLP and the IFP
• Parallel collision search with cryptanalytic applications
• Reducing elliptic curve logarithms to logarithms in a finite field
• Selecting cryptographic key sizes
• The discrete logarithm problem on elliptic curves of trace one
• Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval

Cited in

(3)

• Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
• On the strength comparison of the ECDLP and the IFP
• Complexity bounds on Semaev's naive index calculus method for ECDLP

Describes a project that uses

Uses Software

• CAIRN 2
• gmp

This page was built for publication: Computational hardness of IFP and ECDLP

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