Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
C
curve13318-paper
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Amber Sprenkels
curve13318-paper
Commits
6c3cbeb1
Commit
6c3cbeb1
authored
5 years ago
by
Daan Sprenkels
Browse files
Options
Downloads
Patches
Plain Diff
Remove badly parsed sentence
parent
23ced08d
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
implementation.tex
+1
-1
1 addition, 1 deletion
implementation.tex
with
1 addition
and
1 deletion
implementation.tex
+
1
−
1
View file @
6c3cbeb1
...
...
@@ -52,7 +52,7 @@ We compute the affine representation of $x_R$ and $y_R$ by computing the inverse
Like most implementations of Curve25519 scalar multiplication,
we use Fermat's little theorem and raise
$
Z
_
R
$
to the power
$
2
^{
255
}
-
21
$
to obtain
$
Z
_
R
^{
-
1
}$
.
We chose not to exploit the optimization described in~
\cite
{
BY19
}
,
because
the
implementations
we compare to
have not had the opportunity to implement this technique;
because
previous
implementations have not had the opportunity to implement this technique;
exploiting this invention would give us an unfair advantage.
In the following subsections we describe the architecture-specific optimizations
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment