Computational hardness of IFP and ECDLP

DOI10.1007/S00200-016-0291-XzbMATH Open1391.94819OpenAlexW2327995849MaRDI QIDQ505664FDOQ505664

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

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

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)

Cites Work

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

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

Uses Software

• gmp
• CAIRN 2

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)