Re: easier authentication?

staym@accessdata.com
Mon, 12 Oct 1998 23:15:01 -0600

• Next message: Mok-Kong Shen: "Re: easier authentication?"
• Previous message: Enzo Michelangeli: "Re: easier authentication?"
• Maybe in reply to: mgraffam@idsi.net: "easier authentication?"

>>The 256 bit keys supported by the AES ciphers are probably a lot larger
>>than are needed today. The cipher has to be good for decades, and if
>>quantum computers work, a 256 bit key is like a 128 bit one. But until
>>then, 128 bits should be plenty. That's still a pretty long passphrase.
>
>Are there quantum algorithms suitable to break symmetric ciphers? The only
>(potential) applications I'm aware of are those based on Shor's algorithm,
>targeting public-key cryptosystems.
>Enzo

Any algorithm wherein you can test a guess in polynomial time (NP) a
quantum computer can solve in O(sqrt(N)); i.e it cuts the key length in
half.

-- 
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:staym@accessdata.com

• Next message: Mok-Kong Shen: "Re: easier authentication?"
• Previous message: Enzo Michelangeli: "Re: easier authentication?"
• Maybe in reply to: mgraffam@idsi.net: "easier authentication?"