Comments on: 公开密钥的加密法: RSA加密算法 http://www.cnphil.com/archives/138 In Pursuit of Excellence Tue, 17 Aug 2010 15:02:58 +0000 hourly 1 http://wordpress.org/?v=3.0 By: 代写 http://www.cnphil.com/archives/138/comment-page-1#comment-1680 代写 Wed, 27 Jan 2010 01:21:45 +0000 http://www.cnphil.com/?p=138#comment-1680 博客不错！ 博客不错！

]]> By: yangzhe1990 http://www.cnphil.com/archives/138/comment-page-1#comment-1656 yangzhe1990 Mon, 11 Jan 2010 09:18:42 +0000 http://www.cnphil.com/?p=138#comment-1656 768-bit RSA cracked 768-bit RSA cracked

]]> By: Nimo http://www.cnphil.com/archives/138/comment-page-1#comment-1467 Nimo Sat, 03 Oct 2009 03:07:15 +0000 http://www.cnphil.com/?p=138#comment-1467 更新太慢了 学学matrix67 更新太慢了

学学matrix67

]]> By: Phil http://www.cnphil.com/archives/138/comment-page-1#comment-1442 Phil Mon, 17 Aug 2009 18:48:23 +0000 http://www.cnphil.com/?p=138#comment-1442 @Nimo 很快就会有更新了. @Nimo
很快就会有更新了.

]]> By: Nimo http://www.cnphil.com/archives/138/comment-page-1#comment-1437 Nimo Wed, 05 Aug 2009 10:37:37 +0000 http://www.cnphil.com/?p=138#comment-1437 很久没有更新了，期待啊 很久没有更新了，期待啊

]]> By: Mgccl http://www.cnphil.com/archives/138/comment-page-1#comment-1430 Mgccl Sun, 26 Jul 2009 00:08:33 +0000 http://www.cnphil.com/?p=138#comment-1430 我以为O(n^c)以下就是多项式时间啊...= = 我以为O(n^c)以下就是多项式时间啊…= =

]]> By: Phil http://www.cnphil.com/archives/138/comment-page-1#comment-1429 Phil Fri, 24 Jul 2009 01:27:42 +0000 http://www.cnphil.com/?p=138#comment-1429 <a href="#comment-1427" rel="nofollow">@Mgccl </a> Pollard p-1 算法只有O(sqrt(n))的复杂度. 目前因式分解的最快算法NFS仍有O((log n)^(1/3)(log log n)^(2/3))的复杂度. 线性算法是比较慢的了. @Mgccl
Pollard p-1 算法只有O(sqrt(n))的复杂度.
目前因式分解的最快算法NFS仍有O((log n)^(1/3)(log log n)^(2/3))的复杂度.
线性算法是比较慢的了.

]]> By: Mgccl http://www.cnphil.com/archives/138/comment-page-1#comment-1427 Mgccl Thu, 23 Jul 2009 13:35:25 +0000 http://www.cnphil.com/?p=138#comment-1427 "而目前因式分解的较优算法仍然有O(n^1/2)的复杂度" 呃...比线性还快...? “而目前因式分解的较优算法仍然有O(n^1/2)的复杂度”
呃…比线性还快…?

]]>