Computational hardness of IFP and ECDLP
type: Item
instance of: scholarly article
title: Computational hardness of IFP and ECDLP
zbMATH Open document ID: 1391.94819
author: Masaya Yasuda
author: Takeshi Shimoyama
author: Jun Kogure
author: Tetsuya Izu
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2017-01-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 11Y11
zbMATH DE Number: 6678274
zbMATH Keywords: IFP
zbMATH Keywords: number field sieve
zbMATH Keywords: elliptic curve discrete logarithm problem (ECDLP)
zbMATH Keywords: Pollard's rho method
describes a project that uses: gmp
describes a project that uses: CAIRN 2
MaRDI profile type: Publication
full work available at URL: s00200-016-0291-x
OpenAlex ID: W2327995849
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: A Kilobit Special Number Field Sieve Factorization
cites work: Elliptic Curve Cryptosystems
cites work: Cryptanalysis with COPACOBANA
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: ECC2K-130 on NVIDIA GPUs
cites work: On the Correct Use of the Negation Map in the Pollard rho Method
cites work: Q4265362
cites work: Factorization of the Eighth Fermat Number
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
cites work: CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
cites work: Parallel collision search with cryptanalytic applications
cites work: Q4217446
cites work: Q4902135
cites work: Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
cites work: Mathematics of public key cryptography.
cites work: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
cites work: Improving the parallelized Pollard lambda search on anomalous binary curves
cites work: Q4826108
cites work: Factorization of a 768-Bit RSA Modulus
cites work: Q4273679
cites work: Selecting cryptographic key sizes
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q4502755
cites work: Advances in Cryptology - CRYPTO 2003
cites work: The discrete logarithm problem on elliptic curves of trace one
cites work: Q3840196
cites work: On random walks for Pollard's rho method
cites work: Q4250816
cites work: On the Strength Comparison of the ECDLP and the IFP
DOI: 10.1007/S00200-016-0291-X
description: scientific article; zbMATH DE number 6678274