Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • 2
    $\begingroup$ 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. $\endgroup$ Commented Feb 24, 2017 at 4:01
  • $\begingroup$ 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. $\endgroup$ Commented Apr 7, 2017 at 1:49