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
d668f985
Commit
d668f985
authored
Jun 17, 2019
by
Benoit Viguier
Browse files
typos
parent
1ff0f1e3
Changes
1
Hide whitespace changes
Inline
Side-by-side
readings/5_UsingVST.tex
View file @
d668f985
...
...
@@ -160,8 +160,8 @@ Using this formalization, we prove that the 255 steps of the montgomery ladder i
\subsection
{
Time and Space Complexity
}
Our work can be split into multiple parts. Bellow we provide a approximation of
the lines of codes and thus an idea of the size of the proofs required to
Our work can be split into multiple parts. Bellow we provide a
n
approximation of
the
number of
lines of codes and thus an idea of the size of the proofs required to
complete this work.
\begin{itemize}
\item
The proof that the Montgomery ladder over a generic field
$
\K
$
respects
...
...
Write
Preview
Markdown
is supported
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