看板
[ Bugtraq ]
討論串Breaking RSA: Totient indirect factorization
共 6 篇文章
內容預覽:
This is an OpenPGP/MIME signed message (RFC 2440 and 3156). --------------enig357643D7A6333DFB4E2A1033. Content-Type: text/plain; charset=ISO-8859-1.
(還有798個字)
內容預覽:
Gandlf, I'm working on a bizarrely similar project (you don't happen. to hail from New York, do you?) and have found that using the totient. function,
(還有273個字)
內容預覽:
> So what is the expected running time of your algorithm? For example,. > how long it will take on average to factor a 1024-bit modulus?. I don't know
(還有469個字)
內容預覽:
On Wed, Nov 14, 2007 at 10:59:42PM +0100, gandlf wrote:. .... > Algorithm. > ---------. >. > - Repeat "a = a^n mod m" with n from 2 to m, saving all t
(還有619個字)
內容預覽:
On Wed, 14 Nov 2007, gandlf wrote:. > 1) m = p*q -> RSA modulus. >. > [...]. >. > Algorithm. > ---------. >. > - Repeat "a = a^n mod m" with n from 2
(還有294個字)