Timeline for Quantum Resistance Characteristics - why symmetric?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3, 2018 at 19:35 | answer | added | Ella Rose | timeline score: 8 | |
| Apr 3, 2018 at 14:04 | history | edited | poncho |
edited tags
|
|
| Apr 3, 2018 at 13:32 | review | Close votes | |||
| Apr 3, 2018 at 20:21 | |||||
| Apr 3, 2018 at 13:13 | comment | added | forest | Reminds me of Unseen (Unsene)'s "multidimensional xAES encryption" lol | |
| Apr 3, 2018 at 12:29 | comment | added | Overmind | Patents are just that. A practical implementation is a whole different matter. | |
| Apr 3, 2018 at 11:22 | comment | added | forest | Oh wait so, like some kind of joke? Or are you serious? A 2MB key for a cipher is pure snake oil, especially since it's specifically patented! | |
| Apr 3, 2018 at 8:24 | comment | added | Overmind | Encryption based on fractal geometry... As references, you may study Mandelbrot B. B. “The Fractal Geometry of Nature”, Barnsley M. “Fractals everywhere”, Pickover C. “Computers, Pattern, Chaos, and Beauty”, W. S. Maki, Simple Geometric Fractals, Behavior Research Methods, Instruments and Computers, M. A. Alia, A. B. Samsudin, New Key Exchange Protocol Based on Mandelbrot and Julia Fractal Sets And some US patents apps like No. 20040202326, 20030118185, 20030182246 plus actual patents like US5007087A, US20030182246A1, US20040202326A1. | |
| Apr 3, 2018 at 8:17 | history | migrated | from security.stackexchange.com (revisions) | ||
| Apr 3, 2018 at 6:11 | comment | added | forest | @Overmind What in the world is fractal encryption? | |
| Apr 3, 2018 at 5:11 | comment | added | Overmind | No worries here. I use fractal encryption with 2MB key. Shor's algorithm is about efficiency in solving various algorithms. | |
| Apr 3, 2018 at 0:24 | comment | added | forest | Shor's algorithm solves certain mathematical problems more efficiently than classical algorithms. Specifically, it solves integer factorization and the discrete log problem, which breaks RSA and DSA/DHE, respectively. Symmetric ciphers are not vulnerable to this because they do not rely on mathematical "hardness problems". We know for a fact that nothing can do better than grover's algorithm because all it does is allow searching a keyspace faster. The new NIST public key crypto simply uses hardness problems that cannot be cracked by a quantum computer (e.g. R-LWE). | |
| Apr 2, 2018 at 17:08 | comment | added | Gordon Davisson | This is also an extremely broad question, far beyond the normal scope of stackexchange questions. | |
| Apr 2, 2018 at 15:31 | comment | added | Gregory Magarshak | This question may better belong in cryptography stackexchange so admins can migrate it. | |
| Apr 2, 2018 at 15:06 | history | asked | Gregory Magarshak | CC BY-SA 3.0 |