Timeline for Constant time multiplication in GF(2^8)
Current License: CC BY-SA 4.0
19 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 14, 2021 at 6:42 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 27, 2020 at 5:32 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 27, 2020 at 5:27 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 27, 2020 at 5:21 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 27, 2020 at 5:14 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 23:19 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 23:07 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 22:07 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Add mult1B_shift8 and a TIO
|
Jul 26, 2020 at 18:36 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 18:26 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 17:41 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 17:32 | comment | added | fgrieu♦ | @kelalaka: this source code is out of my head at time of writing. I checked that it gives the same result as other code. I use the same technique in lots of my code. | |
Jul 26, 2020 at 17:31 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Made a compact version
|
Jul 26, 2020 at 17:23 | comment | added | kelalaka | Is there any source of this code? If you wish I can extend this answer with disassembly. It clearly shows that there is no optimization around. | |
Jul 26, 2020 at 17:21 | comment | added | kelalaka |
In Linux/GCC this function has 118 disassembly lines. Run the command objdump -Mintel -d a.out on the compiled output a.out .
|
|
Jul 26, 2020 at 12:42 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 12:36 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 11:04 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
Jul 26, 2020 at 10:50 | history | answered | fgrieu♦ | CC BY-SA 4.0 |