Timeline for answer to Couldn't we create a string that produces the same hash as another string in SHA-256? by rexkogitans
Current License: CC BY-SA 4.0
Post Revisions
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2020 at 19:38 | comment | added | rexkogitans | @user253751 By "not invertible" I mean the mathematical, strictly formal sense, as in g is the inverse function of f if and only if g(f(x))=x for all x of the input domain. Such a function g does not exist if f is not bijective. Of course, brute force is always possible. | |
| Aug 14, 2020 at 12:16 | comment | added | Stack Exchange Broke The Law | "Not invertible" doesn't mean you can't find an input with a given output. | |
| Aug 12, 2020 at 10:16 | history | edited | rexkogitans | CC BY-SA 4.0 |
deleted 19 characters in body
|
| Aug 12, 2020 at 8:22 | history | answered | rexkogitans | CC BY-SA 4.0 |