meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 3 months |
| seen | Mar 29 at 11:50 | |
| stats | profile views | 0 |
|
Feb 23 |
comment |
Is the following key stretching algorithm as memory hard as I think it is? It does seem like you understood the scheme properly. I greatly appreciate your clear expression of the actual memory usage; The formula is so simple and beautiful now that I see it. What I did understand, however, was that a large number of iterations were a requirement to be any amount of memory-hard. The algorithm may have some subtleties; I updated my question with the reason why I don't think it makes sense to initialize the array. Any thoughts? |
|
Feb 23 |
awarded | Editor |
|
Feb 23 |
revised |
Is the following key stretching algorithm as memory hard as I think it is? added clarification and further analysis of the algorithm based on response |
|
Feb 23 |
asked | Is the following key stretching algorithm as memory hard as I think it is? |
|
Feb 11 |
comment |
Can the hash of one message be used to make it easier to find the hash of a very similar message? Thanks for a good answer that really goes into several things I was wondering. The advice to use HMAC for this kind of situation seems like a substantial improvement. The way I understand your answer (and the abstract from the linked paper) is that using HMAC makes exploiting any correlation harder/impossible. Is this correct? |
|
Feb 11 |
awarded | Scholar |
|
Feb 11 |
awarded | Supporter |
|
Feb 11 |
accepted | Can the hash of one message be used to make it easier to find the hash of a very similar message? |
|
Feb 10 |
awarded | Student |
|
Feb 10 |
asked | Can the hash of one message be used to make it easier to find the hash of a very similar message? |
