Computational hardness of IFP and ECDLP

作者：Yasuda Masaya^*; Shimoyama Takeshi; Kogure Jun; Izu Tetsuya

来源：Applicable Algebra in Engineering Communication and Computing, 2016, 27(6): 493-521.

DOI：10.1007/s00200-016-0291-x

• IFP
• The number field sieve
• ECDLP
• Pollard's rho method

The RSA cryptosystem and elliptic curve cryptography (ECC) have been used practically and widely in public key cryptography. The security of RSA and ECC respectively relies on the computational hardness of the integer factorization problem (IFP) and the elliptic curve discrete logarithm problem (ECDLP). In this paper, we give an estimate of computing power required to solve each problem by state-of-the-art of theory and experiments. By comparing computing power required to solve the IFP and the ECDLP, we also estimate bit sizes of the two problems that can provide the same security level.

• 出版日期2016-12