Re: RSA not an easy crack
On Fri, Apr 26, 2002 at 11:18:16AM +0200, DSC Siltec wrote:
> Now, define this function to be F, and define P to be the product of
> a whole bunch of functions F. Now, define that a function F is to be
> centered at any integer location where the value of the function is 1.
Consider the case of a 512-bit product of two 256-bit primes. In this
case, your "whole bunch of functions" is going to have a cardinality
(if I read your pseudo-Sieve of Erathostenes idea correctly) on the order
of P * 2^128 (where P is the fraction of integers that are prime), or
P * 340,282,366,920,938,463,463,374,607,431,768,211,456 functions F.
Back to the drawing board, I would say.
-Michael Robinson
--
To UNSUBSCRIBE, email to debian-security-request@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org
Reply to: