From db6340248af0adc347cc2b4926ee7fb0d24e515d Mon Sep 17 00:00:00 2001 From: Brian Lawrence Date: Wed, 4 Sep 2024 13:25:21 -0700 Subject: [PATCH] Minor edits --- src/mpc.typ | 2 +- src/pair.typ | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/mpc.typ b/src/mpc.typ index 7feb7e0..b9c40c7 100644 --- a/src/mpc.typ +++ b/src/mpc.typ @@ -164,7 +164,7 @@ We'll need to make two changes to the protocol. Of course, the solution is to use a hash function! So here is the new version of our garbled gate. - For simplicity, I'll assume it's an AND gate -- + For simplicity, we'll assume it's an AND gate -- so the outputs will be (the passwords encoding) 0, 0, 0, 1. #table( columns: 2, diff --git a/src/pair.typ b/src/pair.typ index 0cea86b..c3994ab 100644 --- a/src/pair.typ +++ b/src/pair.typ @@ -32,7 +32,7 @@ if this pairing can be computed reasonably quickly This construction actually uses some really deep number theory (heavier than all the math in @ec) -that is well beyond the scope of these lecture notes. +that is well beyond the scope of this modest book. Fortunately, we won't need the details of how it works; but we'll comment briefly in @pairing-friendly on what curves it can be done on. And this pairing algorithm needs to be worked out just once for the curve $E$;