Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Benoit Viguier
coq-verif-tweetnacl
Commits
94f05077
Commit
94f05077
authored
Oct 01, 2019
by
Freek Wiedijk
Browse files
Fiddling with the discussion of the various ladders in chapter 5.
parent
1a6f1468
Changes
1
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),
similar to the one used in
TweetNaCl.
(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"?
We prove its correctness for any points which
\xcoord
is not 0.
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment