/explore
|
You are here 
|
windowsontheory.org | ||
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | A guest post by Eric Allender prompted by an (incorrect)P? NP proof recently published in Springer Nature's Frontiers of Computer Scie... | |
| | | | |
rjlipton.com
|
|
| | | | | Algorithms with huge running times David Johnson is a renown computer theorist who was awarded the 2009 Knuth Prize, for his seminal contributions to theory. He is famous for: his many great papers on various aspects of algorithmic theory, his classic book ``Computers and Intractability: A Guide to the Theory of NP-Completeness" with Mike Garey,... | |
| | | | |
keymaterial.net
|
|
| | | | | After publishing my series on UOV, one feedback I got was that my blog posts made people feel more confident in the security of the scheme, because "at least someone is looking into these things". I don't necessarily know if that is the takeaway I would make from my posts, but it gave me the... | |
| | | | |
rareskills.io
|
|
| | | Elliptic Curves over Finite Fields What do elliptic curves in finite fields look like? It's easy to visualize smooth elliptic curves, but what do elliptic curves over a finite field look like? The following is a plot of $y² = x³ + 3 \pmod {23}$ Because we only allow integer inputs (more specifically, finite field... | ||
