aboutsummaryrefslogtreecommitdiff
path: root/expansion.md
diff options
context:
space:
mode:
authorGravatar Andres Erbsen <andreser@mit.edu>2017-01-13 09:14:23 -0500
committerGravatar GitHub <noreply@github.com>2017-01-13 09:14:23 -0500
commitd82f8f1c9543f4cdb637fc2735e65e77bfd0f0ad (patch)
tree53a023badf62c4990bb51b9ce942be0807d5282e /expansion.md
parentd5c38e6648b30e139782ac67533a1ed54119f87c (diff)
Update expansion.md
Diffstat (limited to 'expansion.md')
-rw-r--r--expansion.md4
1 files changed, 4 insertions, 0 deletions
diff --git a/expansion.md b/expansion.md
index ddb0c328e..8e2b34c95 100644
--- a/expansion.md
+++ b/expansion.md
@@ -79,6 +79,10 @@ so the first task would be to figure out how much of them can be reused.
maybe modeled after Brian Smith's ring library or go.crypto. Note that we would
first need to have some story for modular multiplication at RSA sizes.
+**NewHope-simple** -- study it, see what would be needed to create an implementation.
+
+**McBits** -- study it, see what would be needed to create an implementation.
+
**verified compilation** of PHOAS straight-line code to Jasmine-lang. This would
involve register allocation and instruction scheduling.