Timeline for Proposals for polymath projects
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2017 at 1:49 | comment | added | Joseph Van Name | So it looks like the $n$-ary Laver tables could be used as platform for this key exchange arxiv.org/pdf/1305.4401.pdf. Furthermore, since the $n$-ary Laver tables can be endowed with a composition operation, the Ko-Lee key exchange applies to the $n$-ary Laver tables as well. This will be indeed the first and only practical application of set theory. If $n$-ary Laver table based cryptosystems are secure against classical computers, then it seems like they will continue to remain secure against quantum computers. | |
| Feb 24, 2017 at 4:01 | comment | added | Joseph Van Name | I have been considering making the goal of this project to construct a public key cryptosystems from the algebras of elementary embeddings and make the cryptosystem as secure and efficient as possible. Though, it is too early to discuss the specifics of this project. | |
| S Jul 14, 2016 at 18:07 | history | answered | Joseph Van Name | CC BY-SA 3.0 | |
| S Jul 14, 2016 at 18:07 | history | made wiki | Post Made Community Wiki by Joseph Van Name |