An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices

Abstract. One of the most frequent operations in modern cryptosystems is a multi-scalar multiplication with two scalars. Common methods to compute it are the Shamir method and the Interleave method whereas their speed mainly depends on the (joint) Hamming weight of the scalars. To increase the speed, the scalars are usually deployed using some general representation which provides a lower (joint) Hamming weight than the binary representation. However, by using such general representations the precomputation and storing of some points becomes necessary and therefore more memory is required. Probably the most famous method to speed up the Shamir method is the joint sparse form (JSF). The resulting representation has an average joint Hamming weight of 1/2 and

• Type: Conference
• Year: 2005
• Where: ESAS
• Authors: Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi
• Keywords: ESAS 2005, General Representations, Hamming Weight, Shamir Method