Timeline for Number theory in symmetric cryptography
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2022 at 15:16 | comment | added | kelalaka | Pohlig-Helman cipher. | |
| Oct 4, 2020 at 9:22 | vote | accept | preBob | ||
| Oct 4, 2020 at 9:03 | comment | added | Ben Smith | @JohannesHahn, AES-GCM (Galois Counter Mode) is maybe an even better example (since another finite field, and more number-theoretical arguments, appear in the "GCM" part) - and it's certainly high-speed and practical. | |
| Oct 4, 2020 at 7:30 | answer | added | Ben Smith | timeline score: 11 | |
| Oct 4, 2020 at 7:04 | answer | added | kodlu | timeline score: 6 | |
| Oct 3, 2020 at 22:05 | comment | added | Mark Schultz-Wu | @JohannesHahn It is worth mentioning that the "real" speed improvement which makes symmetric ciphers fast is that of hardware implementation. I believe AES gets a ~40 times speed increase when run in hardware vs software, for example. | |
| Oct 3, 2020 at 21:59 | answer | added | Mark Schultz-Wu | timeline score: 4 | |
| Oct 3, 2020 at 20:50 | history | became hot network question | |||
| Oct 3, 2020 at 15:49 | comment | added | Johannes Hahn | By the way: Since most symmetric ciphers that occur in the "real world" are designed to be as fast as possible on current computer hardware, they don't often use complicated functions. Instead they rely on "simple" functions derived from bit manipulation and basic arithmetic and combine them in clever ways. This does not preclude that some examples of what you're looking for do exist, but it makes it seem a bit less likely to me. | |
| Oct 3, 2020 at 15:47 | comment | added | Johannes Hahn | Well that's what I'm asking you. Is the theorem that a field with 256 elements exists, number-theoretic enough for you? Is it more than "most basic" arithmetic? | |
| Oct 3, 2020 at 15:40 | answer | added | Mark Wildon | timeline score: 11 | |
| Oct 3, 2020 at 15:38 | comment | added | preBob | @JohannesHahn But does AES use some number-theoretic theorem? | |
| Oct 3, 2020 at 15:33 | comment | added | Johannes Hahn | AES uses addition, multiplication and multiplicative inverses in $\mathbb{F}_{256}$. Is that number theoretic and more than "most basic" arithmetic? | |
| Oct 3, 2020 at 13:21 | history | edited | YCor | CC BY-SA 4.0 | removed capitals |
| Oct 3, 2020 at 12:47 | review | First posts | |||
| Oct 3, 2020 at 13:53 | |||||
| Oct 3, 2020 at 12:43 | history | asked | preBob | CC BY-SA 4.0 |