| 1 |
Sebastian Günther wrote: |
| 2 |
> * Volker Armin Hemmann (volker.armin.hemmann@××××××××××××.de) [27.06.08 00:12]: |
| 3 |
>> and this is why nobody uses brute force. |
| 4 |
>> |
| 5 |
>> There a better ways to crack keys. NSA has tons of experts in mathematics and |
| 6 |
>> cryptanalysis. Plus very sophisticated hardware. I am sure for most ciphers |
| 7 |
>> they use something much more efficient than stupid brute force. |
| 8 |
>> |
| 9 |
> |
| 10 |
> The thing about this keys is, that there is no better way than to brute |
| 11 |
> force such keys. The algorithm uses a function which inverse is a known |
| 12 |
> hard problem which resides in NP, which is a class of functions equal to |
| 13 |
> just guessing. |
| 14 |
|
| 15 |
I don't believe this is true. The algorithm uses a function which is |
| 16 |
*assumed* to be a hard problem. You assume the problem is hard because |
| 17 |
you and anyone you know have not been able to make it easy. That does |
| 18 |
not mean that someone has not discovered some math that does make it easy. |
| 19 |
|
| 20 |
Here's a reference to the interesting meet-in-the-middle attack which |
| 21 |
reduced 3DES key space down to 112 bits from 192. Obviously that was |
| 22 |
unknown when 3DES was built. |
| 23 |
http://en.wikipedia.org/wiki/Triple_DES#Security |
| 24 |
|
| 25 |
kashani |
| 26 |
-- |
| 27 |
gentoo-user@l.g.o mailing list |
Archives