Timeline for Which algorithm is the simplest reversible fixed-size length-preserving symmetric "cryptography" with low probability of collision?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2020 at 11:42 | vote | accept | dawid | ||
| Nov 7, 2020 at 3:11 | history | edited | dawid | CC BY-SA 4.0 |
edited title
|
| Apr 26, 2020 at 18:58 | history | edited | dawid | CC BY-SA 4.0 |
edited title
|
| Apr 21, 2020 at 12:09 | comment | added | Gilles 'SO- stop being evil' | What are your performance requirements? What platform will the code run on? If you're planning to write Python code to run on PC-class hardware, then using AES for a few blocks will barely even register in benchmarks. AES is absolutely not slow on that scale. If your real platform is an 8-bit microcontroller and you have tight real-time dealines, AES may indeed be a problem. | |
| Apr 21, 2020 at 12:00 | answer | added | fgrieu♦ | timeline score: 1 | |
| Apr 21, 2020 at 9:44 | comment | added | dawid | I've added some code of my attempts. | |
| Apr 21, 2020 at 9:43 | history | edited | dawid | CC BY-SA 4.0 |
code
|
| Apr 20, 2020 at 8:17 | comment | added | Mark Schultz-Wu♦ | What do you mean by "reversible"? Generally one would interpret this as "injective", but injective functions cannot have collisions. | |
| Apr 20, 2020 at 6:52 | comment | added | DannyNiu | Also comes into my mind is the OAEP padding used in RSA encryption. | |
| Apr 20, 2020 at 6:51 | comment | added | DannyNiu | Salsa/ChaCha-20 are examples of good stream ciphers, as such, when you use them, you need to provide key and nonce (a.k.a. initialization vector) | |
| Apr 20, 2020 at 6:40 | review | First posts | |||
| Apr 20, 2020 at 8:08 | |||||
| Apr 20, 2020 at 6:35 | history | asked | dawid | CC BY-SA 4.0 |