On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
暂无分享,去创建一个
[1] Dan Boneh,et al. Breaking RSA May Not Be Equivalent to Factoring , 1998, EUROCRYPT.
[2] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[3] V. Nechaev. Complexity of a determinate algorithm for the discrete logarithm , 1994 .
[4] Ivan Damgård,et al. Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups , 2002, EUROCRYPT.
[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.