Computational hardness of IFP and ECDLP

DOI10.1007/s00200-016-0291-xzbMath1391.94819OpenAlexW2327995849MaRDI QIDQ505664

Jun Kogure, Takeshi Shimoyama, Masaya Yasuda, 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)

Related Items (2)

Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP

Uses Software

• gmp
• CAIRN 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Parallel collision search with cryptanalytic applications
• The discrete logarithm problem on elliptic curves of trace one
• On random walks for Pollard's rho method
• Mathematics of Public Key Cryptography
• Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
• On the Strength Comparison of the ECDLP and the IFP
• ECC2K-130 on NVIDIA GPUs
• On the Correct Use of the Negation Map in the Pollard rho Method
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
• Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
• Factorization of a 768-Bit RSA Modulus
• Elliptic Curve Cryptosystems
• Factorization of the Eighth Fermat Number
• A method for obtaining digital signatures and public-key cryptosystems
• Monte Carlo Methods for Index Computation (mod p)
• Reducing elliptic curve logarithms to logarithms in a finite field
• Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Cryptanalysis with COPACOBANA
• A Kilobit Special Number Field Sieve Factorization
• Advances in Cryptology - CRYPTO 2003
• Selecting cryptographic key sizes

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