this is for holding javascript data
Scott Fluhrer edited untitled.tex
almost 9 years ago
Commit id: e5967e99211d8b96ba74d9e1f0ee9d72698c454c
deletions | additions
diff --git a/untitled.tex b/untitled.tex
index 271893e..fc1c334 100644
--- a/untitled.tex
+++ b/untitled.tex
...
To speed this operation, one approach is to select a prime $p$ with a representation $2^e + c$, where $c$ has a simple representation in binary. What this allows us to do is accelerate the computation of the modulus by taking advantage of the identity:
$$a \cdot 2^e + b \equiv a \cdot c + b \pmod{2^e+c}$$
If the
binary representation of $c$ is simple enough, we can compute $a \cdot c$ without doing a full multiply, and hence we can compute this modular reduction significantly faster than we could for an arbitrary prime. Examples of Elliptic Curves that allow this speed up include the so-called NIST curves, Curve25519, and the Microsoft NUMS curves.
- Side channel attacks
- Scalar randomizatoin