I suspect he was thinking of exponents. i.e. srt(2^12)=2^6=64 IOW srt=exp/2
when expressed that way. Yes?
*-----Original Message-----
*From: [EMAIL PROTECTED]
*[mailto:[EMAIL PROTECTED]]On Behalf Of Todd
*Sent: Thursday, November 30, 2000 11:14 PM
*To: '[EMAIL PROTECTED]'
*Subject: Re: Ben's Big Crypto Flamefest
*
*
*folx,
*
*On Thu, 30 Nov 2000, Ben Nagy wrote:
*
*> No. You couldn't. Brute forcing a 4kb key is not possible
*without a trapdoor
*> or flaw in the algorithm. IOW - even taking factoring as an example...
*> Quantum computing may become real. This effectively square roots the
*> complexity of an arbitrary calculation. That makes a 4096 bit
*number as hard
*> to factor as a 2048 bit one. Big deal. 2048 bits is well outside
*the realms
*> of possibility with an amazing new algorithm for factoring.
*
*careful here. unless i'm misunderstanding your calculation, quantum
*algorithms (when running on quantum computing devices that don't exist
*yet) reduce complexity to the square root, but srt(4096) = 64, not
*2048. 64 bits is quite tolerable (not easy, but tolerable), especially if
*there are any entropy-reducing errors in the algorithm already.
*
*am i missing something?
*
*=========================================================
*Todd Underwood, [EMAIL PROTECTED]
*
*criticaltv.com
*news, analysis and criticism. about tv.
*and other stuff.
*
*=========================================================
*
*-
*[To unsubscribe, send mail to [EMAIL PROTECTED] with
*"unsubscribe firewalls" in the body of the message.]
*
-
[To unsubscribe, send mail to [EMAIL PROTECTED] with
"unsubscribe firewalls" in the body of the message.]
