Cryptography Reference
In-Depth Information
=
a
j
(mod
r
). This
by taking the product of a random subset of the
g
a
j
and setting
a
method is presented as the “simple solution” in [
141
].
A more sophisticated method for Koblitz curves is given by Coron, M'Raıhi and
Tymen [
141
]. They use repeated application of sparse Frobenius expansions on elements
of the precomputed table. They also give a security analysis.
