Fast Multi-computations with Integer Similarity Strategy

Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithms to improve multi-computations can be classified into two main categories: precomputing methods and recoding methods. The first one uses a table to store the precomputed values, and the second one finds a better binary signed-digit (BSD) representation. In this article, we propose a new integer similarity strategy for multi-computations. The proposed strategy can aid with precomputing methods or recoding methods to further improve the performance of multi-computations. Based on the integer similarity strategy, we propose two efficient algorithms to improve the performance for BSD sparse

• Type: Conference
• Year: 2005
• Where: PKC
• Authors: Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
• Keywords: Better Binary Signed-digit, Cryptography, Integer Similarity Strategy, PKC 2005, Public Key Cryptosystems