[133400] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: RSA modulus record

daemon@ATHENA.MIT.EDU (Joseph Ashwood)
Wed Sep 17 09:56:35 2008

From: "Joseph Ashwood" <ashwood@msn.com>
To: <cryptography@metzdowd.com>
In-Reply-To: <20080916210827.GK22033@np305c2n2.ms.com>
Date: Tue, 16 Sep 2008 21:03:00 -0700

----- Original Message ----- 
From: "Victor Duchovni" <Victor.Duchovni@morganstanley.com>
To: <cryptography@metzdowd.com>
Sent: Tuesday, September 16, 2008 2:08 PM
Subject: Re: RSA modulus record


> On Tue, Sep 16, 2008 at 09:01:51PM +0200, Weger, B.M.M. de wrote:
>
>> There's a new biggest known RSA modulus.
>> It is (in hexadecimal notation):
>>
>> FF...(total of 9289166 F's)...FFDFF...(total of 1488985
>> F's)...FF800...(total of 9289165 0's)...001
>>
>> It is guaranteed to be the product of two different large primes,
>
> Are the primes actually known, or just "guaranteed to exist"?
>
>> and it has more than 80 million bits. Impressive security...
>
> In what sense is this "impressive security"?


I have to agree that it is impressive, in the same way that having a 
nickname "Tripod" is impressive. Doesn't actually mean much in terms of 
reality neither is all that useful, or realistic for actual use.
                            Joe 

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com

home help back first fref pref prev next nref lref last post