Two tidbits of potential interest
M.B.Jr.
marcio.barbado at gmail.com
Thu Sep 24 21:13:31 CEST 2009
On Thu, Sep 24, 2009 at 2:21 PM, David Shaw <dshaw at jabberwocky.com> wrote:
> On Sep 24, 2009, at 12:30 PM, M.B.Jr. wrote:
>
>> Hi David,
>>
>> about the first "tidbit":
>>
>>
>> On Tue, Sep 22, 2009 at 6:08 PM, David Shaw <dshaw at jabberwocky.com> wrote:
>>>
>>> First of all, someone has factored a 512-bit RSA key (the one used to
>>> protect a TI programmable calculator, it seems). It took 73 days on a
>>> dual-core 1900Mhz Athlon64. It took just under 5 gigs of storage and
>>> around
>>> 2.5 gigs of RAM. In other words: not much at all. It's not some big
>>> distributed project - rather it's a single guy who wanted to factor it
>>> and
>>> just left it running in the background for 2 and a half months. (This is
>>> actually a month old - forgot to send it before now).
>>>
>>> http://www.unitedti.org/index.php?showtopic=8888
>>>
>>
>>
>> dummy question:
>>
>> by factoring a public key integer, one can get somehow to its
>> corresponding private key?
>
> Yes, that's exactly what happens. If you factor the public key, you can
> derive the private key.
>
Is this a generic asymmetric premise?
I mean: is it valid both to the (computational) Mathematics behind
OpenPGP's and X.509's public keys' integers?
Marcio Barbado, Jr.
More information about the Gnupg-users
mailing list