Timeline for Iterated SHA1 hashing and the effect on rainbow table computation
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2019 at 21:42 | vote | accept | Brynjar | ||
| Feb 11, 2019 at 21:31 | history | edited | Tobi Nary | CC BY-SA 4.0 |
added 542 characters in body; added 62 characters in body
|
| Feb 11, 2019 at 15:49 | comment | added | Brynjar | Ok sorry, I wasn't clear in my question, thus the confusion on my part regarding your answer. The salt is actually a salt, not a pepper, in that it is public and known in my scenario.. so it is only the question of what incremental benefit the x times hash the hash gives you. And it seems, 'not much' | |
| Feb 11, 2019 at 14:18 | history | edited | Tobi Nary | CC BY-SA 4.0 |
added 297 characters in body
|
| Feb 11, 2019 at 13:56 | comment | added | Brynjar | ok with you to a degree then. If I have found 1 plaintext -> 1 hash combo, how does that help with anything else? Hashes are designed such that changing one char generates a totally different and unpredictable hash, so what are you iterating exactly? | |
| Feb 11, 2019 at 11:33 | comment | added | Tobi Nary | The first hash being the first hash that is randomly broken (from a supposed number of n hashes that have become public) the 10 bytes of secrets are in a defined space that can be iterated. You may use bitwise add of one with carry or any other way to iterate through the space. | |
| Feb 11, 2019 at 10:17 | comment | added | Brynjar | you lost me on your last para. What is the first vs remaining hashes here? Iterating how exactly? | |
| Feb 11, 2019 at 6:23 | history | answered | Tobi Nary | CC BY-SA 4.0 |