[isapros] Re: OT: FW: Breaking RSA: Totient indirect factorization
- From: "Thomas W Shinder" <tshinder@xxxxxxxxxxx>
- To: <isapros@xxxxxxxxxxxxx>
- Date: Thu, 15 Nov 2007 13:42:32 -0600
Being all encryption methods will eventually be hacked, all encryption
is equally weak.
I thought I was getting dumber with age, but it looked like the world is
moving faster in that direction than I am.
Thomas W Shinder, M.D.
Site: www.isaserver.org
Blog: http://blogs.isaserver.org/shinder/
Book: http://tinyurl.com/3xqb7
MVP -- Microsoft Firewalls (ISA)
> -----Original Message-----
> From: isapros-bounce@xxxxxxxxxxxxx
> [mailto:isapros-bounce@xxxxxxxxxxxxx] On Behalf Of Jim Harrison
> Sent: Thursday, November 15, 2007 1:35 PM
> To: isapros@xxxxxxxxxxxxx
> Subject: [isapros] Re: OT: FW: Breaking RSA: Totient indirect
> factorization
>
> There was a similar discussion on an internal alias regarding
> password entropy and "crackability".
> The sad outcome is that the customer that started the
> discussion is still convinced that (get this):
> "because any password may eventually be cracked, all
> passwords are equally weak".
>
> They also want to "proxy" a set of credentials within the SSL
> session key from a completely different SSL session (shared
> session keys).
> "because I can imagine it; it is good"
>
> -----Original Message-----
> From: isapros-bounce@xxxxxxxxxxxxx
> [mailto:isapros-bounce@xxxxxxxxxxxxx] On Behalf Of Thor
> (Hammer of God)
> Sent: Thursday, November 15, 2007 11:54 AM
> To: isapros@xxxxxxxxxxxxx
> Subject: [isapros] OT: FW: Breaking RSA: Totient indirect
> factorization
>
> I love guys like this ;) (The OP was how to break RSA ;)
>
> t
>
> -----Original Message-----
> From: Clifton Royston [mailto:cliftonr@xxxxxxxx]
> Sent: Thursday, November 15, 2007 8:59 AM
> To: gandlf
> Cc: bugtraq@xxxxxxxxxxxxxxxxx
> Subject: Re: Breaking RSA: Totient indirect factorization
>
> On Wed, Nov 14, 2007 at 10:59:42PM +0100, gandlf wrote:
> ..
> > Algorithm
> > ---------
> >
> > - Repeat "a = a^n mod m" with n from 2 to m, saving all the
> results in
> > a table until a == 1 (Statement 4).
>
> Do I understand correctly that this step of your proposed algorithm
> can identify the private key corresponding to (e.g.) a 1024 bit public
> key, but only by doing on the order of Sum(2..2^1024) = ~ 2^1025
> modular exponentiations and storing the results? If so, that would
> come to approximately 1E307 modular exponentiation operations.
>
> Divide that out by (for example) teraflops and the expected lifetime
> of the universe, and I don't think you will get a pleasing result.
>
> -- Clifton
>
> --
> Clifton Royston -- cliftonr@xxxxxxxxxxxxxxxxxx /
> cliftonr@xxxxxxxx
> President - I and I Computing * http://www.iandicomputing.com/
> Custom programming, network design, systems and network consulting
> services
>
>
>
>
Other related posts:
