JUCS
2008
13 years 4 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
SACRYPT
2004
Springer
13 years 9 months ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
PKC
2004
Springer
13 years 9 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....