Timeline for Can one group the SHA-256 outputs depending on partial inputs?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2012 at 20:13 | history | edited | Paŭlo Ebermann | CC BY-SA 3.0 |
tags, typos, better title
|
| Feb 20, 2012 at 20:02 | comment | added | Paŭlo Ebermann | Welcome to Cryptography Stack Exchange. Your question was migrated here because of being not directly related to software development (the topic of Stack Overflow), and being fully on-topic here. Please register your account here, too, to be able to comment and accept an answer. | |
| Feb 20, 2012 at 18:37 | history | migrated | from stackoverflow.com (revisions) | ||
| Feb 20, 2012 at 18:36 | answer | added | Joachim Isaksson | timeline score: 4 | |
| Feb 20, 2012 at 18:23 | comment | added | ixe013 | I dont know the answer, but I the security properties you are up against are : confusion (change 1 bit and about 50% of the bits change) and diffusion (change 1 bit and changes will be distributed evenly, given enough input). | |
| Feb 20, 2012 at 18:15 | comment | added | user1221679 | thks greg. so, it's not possible to predict even if i know that half of key is "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" or "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb" only? | |
| Feb 20, 2012 at 18:08 | comment | added | President James K. Polk | A secure hash function, or even a not so great hash function, is not going to exhibit any of the properties you are looking for. | |
| Feb 20, 2012 at 17:54 | history | asked | user1221679 | CC BY-SA 3.0 |