Timeline for Collision-free one-wayish function mapping 32 bit to 32 bit
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2018 at 17:16 | comment | added | VincBreaker | While I did know that the discrete logarithm is cyclic, I did not know you can choose the parameters to create a permutation in $[1, q]$. Also respect for coming up with the $\tilde f$ function, which basicly allows to reduce any permutation to a $[1,2^{32}]$ permutation. | |
| Feb 26, 2018 at 16:30 | vote | accept | VincBreaker | ||
| Feb 26, 2018 at 7:59 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Illustrate
|
| Feb 26, 2018 at 7:43 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 26, 2018 at 7:38 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
More gentle introduction
|
| Feb 25, 2018 at 16:21 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 25, 2018 at 9:35 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 25, 2018 at 9:11 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Expand
|
| Feb 25, 2018 at 9:05 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Expand
|
| Feb 25, 2018 at 0:02 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 24, 2018 at 23:32 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 24, 2018 at 23:25 | history | answered | fgrieu♦ | CC BY-SA 3.0 |