|
|
|
| Authored by: Winter on Wednesday, May 29 2013 @ 11:35 AM EDT |
The expert in the article claims his hashcat program using Markov chains would
defeat the XKCD comic shown in the paper.
https://xkcd.com/936/
That is not true. Monroe did factor in the use of such concatenation crackers.
The calculations of the strength actually assume the attacker knows the exact
lists from which the words were drawn. The 44 bits given is a lower bound.
---
Some say the sun rises in the east, some say it rises in the west; the truth
lies probably somewhere in between.[ Reply to This | Parent | # ]
|
- XKCD comic - Authored by: Anonymous on Thursday, May 30 2013 @ 03:39 AM EDT
| |
| Authored by: Wol on Wednesday, May 29 2013 @ 03:47 PM EDT |
NP hard merely means the complexity explodes exponentially. In other words the
estimated time to completion to reverse any reasonably sized computation is
longer than the expected life of the universe.
On the other hand there do exist functions which cannot be run in reverse.
The RSA algorithm gives you an example of both. A message encrypted with RSA can
NOT be cracked. Given as much cipher text as you like, you CANNOT crack the code
and decipher the message. It can't be done. The encryption is NOT reversible.
However, the keys CAN be SOLVED. This is an NP-hard task if the keys have been
calculated correctly - or it can be an easy task if they've slipped up.
Cheers,
Wol[ Reply to This | Parent | # ]
|
|
|
|
|
