Skip to content
GitLab
Commit 94f05077 authored by Freek Wiedijk's avatar Freek Wiedijk
Browse files

Fiddling with the discussion of the various ladders in chapter 5.

parent 1a6f1468
Hide whitespace changes
Inline Side-by-side
paper/5_highlevel.tex
View file @ 94f05077
...@@ -276,7 +276,8 @@ we define a ladder \coqe{opt_montgomery} (in which $\K$ has not been fixed yet), ...@@ -276,7 +276,8 @@ we define a ladder \coqe{opt_montgomery} (in which $\K$ has not been fixed yet),
similar to the one used in similar to the one used in
TweetNaCl. TweetNaCl.
(This definition is closely related to \coqe{montgomery_rec} that was used (This definition is closely related to \coqe{montgomery_rec} that was used
in the definition of \coqe{RFC}, and is easily proved the same.) in the definition of \coqe{RFC}, and is easily proved to correspond to it.
In Coq this correspondence proof is hidden in the proof of \coqe{RFC_Correct} shown above.)
%\ref to the def of montgomery_rec? relevant lemma(s) that show(s) these are "the same"? %\ref to the def of montgomery_rec? relevant lemma(s) that show(s) these are "the same"?
We prove its correctness for any points which \xcoord is not 0. We prove its correctness for any points which \xcoord is not 0.
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment