Timeline for Why is multiplication uncommon in cryptographic primitives?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2021 at 7:28 | comment | added | bryc | Modern compilers often reduce shift and add/sub operations to multiplication, implying that a single multiplication is faster than the equivalent produced with shifts and add/subs. You would also have to first define the minimum amount of xor+shift operations that provide the same mixing potential as multiplication, to truly determine if an equivalent set of bitwise operations has the same mixing potential as a multiplication plus a single xor+shift. | |
| Sep 29, 2017 at 19:15 | history | edited | Greg Jaskiewicz | CC BY-SA 3.0 |
expand on hardware implementations.
|
| Sep 29, 2017 at 18:58 | review | First posts | |||
| Sep 29, 2017 at 19:55 | |||||
| Sep 29, 2017 at 18:54 | history | answered | Greg Jaskiewicz | CC BY-SA 3.0 |