[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Berenstein factoring breakthrough?
- To: misc_(_at_)_openbsd_(_dot_)_org
- Subject: Berenstein factoring breakthrough?
- From: Ben Goren <ben_(_at_)_trumpetpower_(_dot_)_com>
- Date: Tue, 26 Feb 2002 10:37:45 -0700
I know Dan isn't exactly everybody's favorite person, but he's
recently published a paper that describes how to make an
inexpensive special-purpose machine to crack RSA keys less than 2
I won't pretend to be able to understand all--or even most--of the
paper, but I would hope that there are people here who can.
So: would anybody care to confirm or refute his findings? If so,
what effects does this have on the various subsystems (OpenSSL,
OpenSSH, etc.) that implement RSA? Do we need new defaults for key
length, or do we need a new algorithm, or...?
[demime 0.98d removed an attachment of type application/pgp-signature]
Visit your host, monkey.org