Re: The factoring problem
From: Simon Johnson (simon.johnson_at_gmail.com)
Date: 06/27/05
- Next message: SniffinPopRocks: "Re: un-hashing to reveal pass phrase [was: crypto sms]"
- Previous message: paul_at_atom.sbrk.co.uk: "Re: What can one do against Keylogger Attacks?"
- In reply to: RichD: "The factoring problem"
- Next in thread: Dik T. Winter: "Re: The factoring problem"
- Reply: Dik T. Winter: "Re: The factoring problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 27 Jun 2005 02:44:12 -0700
> Sorry for a possibly stupid question...
It's not a stupid question, it's a very important question indeed.
A lot of people to talk about whether factoring in the NP complexity
class as being important to cryptography. This, however, is a tad
misleading. Complexity theory makes a statement about the difficulty of
the problem at infinity. In cryptography, we never work with numbers of
infinite size. It is quite possible that if factoring was found to be
in P that it'd still be useful to cryptography because the P time
algorithm may run in O(n^100).
All that matter to cryptography is that factoring is significantly more
difficult than multiplication at useable sizes of numbers.
Simon.
- Next message: SniffinPopRocks: "Re: un-hashing to reveal pass phrase [was: crypto sms]"
- Previous message: paul_at_atom.sbrk.co.uk: "Re: What can one do against Keylogger Attacks?"
- In reply to: RichD: "The factoring problem"
- Next in thread: Dik T. Winter: "Re: The factoring problem"
- Reply: Dik T. Winter: "Re: The factoring problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|