You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is is possible to generate a short addition chain with addchain taking into account the signed representation {-1,0,1} (2-NAF) of the input integer?
In some-use case (final exponentiation in the pairing computation or elliptic curve scalar multiplication), the inverse is cheap and the 2-NAF has usually lower Hamming weight.
The text was updated successfully, but these errors were encountered:
Is is possible to generate a short addition chain with
addchain
taking into account the signed representation{-1,0,1}
(2-NAF) of the input integer?In some-use case (final exponentiation in the pairing computation or elliptic curve scalar multiplication), the inverse is cheap and the 2-NAF has usually lower Hamming weight.
The text was updated successfully, but these errors were encountered: