Re: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?
From: James Longstreet (jlongs2_at_uic.edu)
Date: 11/01/05
- Previous message: Andrew Farmer: "Re: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- In reply to: Brandon Enright: "RE: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- Next in thread: Bipin Gautam: "Re: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Tue, 1 Nov 2005 13:04:16 -0600 To: full-disclosure@lists.grok.org.uk
On Nov 1, 2005, at 12:11 PM, Brandon Enright wrote:
> IIRC, there aren't any good known attacks against Blowfish, AES, or
> Twofish
> so the *RIGHT* algorithm is whatever works best for your application.
Depending on the situation, there may be a feasible cache-timing
attack on software implementations of AES: http://cr.yp.to/
antiforgery/cachetiming-20050414.pdf
_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/
- Previous message: Andrew Farmer: "Re: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- In reply to: Brandon Enright: "RE: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- Next in thread: Bipin Gautam: "Re: [Full-disclosure] Comparing Algorithms On The List OfHard-to-brut-force?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|