On Fri, 25 Sep 2009 19:22, marcio.barb...@gmail.com said:
And as a conclusion, Elgamal problems would be harder to solve. Is it correct?
No; it is not sure that the discrete logarithm problem is harder to
solve that the factoring problem.
Shalom-Salam,
Werner
--
Die Gedanken sind frei.
On Thu, 24 Sep 2009 21:13, marcio.barb...@gmail.com said:
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?
Yes. All real world asymmetric algorithms are build on a hard so solve
computional
On Sep 24, 2009, at 3:13 PM, M.B.Jr. wrote:
On Thu, Sep 24, 2009 at 2:21 PM, David Shaw ds...@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
ds...@jabberwocky.com wrote:
First of all,
Hi Werner,
On Fri, Sep 25, 2009 at 6:19 AM, Werner Koch w...@gnupg.org wrote:
On Thu, 24 Sep 2009 21:13, marcio.barb...@gmail.com said:
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?
Hi David,
about the first tidbit:
On Tue, Sep 22, 2009 at 6:08 PM, David Shaw ds...@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
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 ds...@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 Thu, Sep 24, 2009 at 2:21 PM, David Shaw ds...@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 ds...@jabberwocky.com wrote:
First of all, someone has factored a 512-bit RSA key (the one
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
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi List readers,
thanks to David Shaw for the nice URL:
http://www.moserware.com/2009/09/stick-figure-guide-to-advanced.html
This one I like very much; The pencil and paper approach.
Also, here's the Stick Figure Guide to AES:
