Papers by Keyword: Multiplication

Abstract: In view of practical applications, it is a high priority to optimize the efficiency of methods for secure multi-party computations. A classic problem is described as following: there are two secrets, α and β, shared among n players using Shamir (t+1,n)-threshold secret sharing scheme, and how to make their product αβshared among n players using the same way. The protocol of Gennaro, Rabin and Rabin (1998) is a well known and efficient protocol for this purpose. It requires one round of communication and O(n2klog2n+nk2) bit-operations per player, where k is the bit size of the computing field and n is the number of players. In a previous paper (2007), the author presented a modification of this protocol, which reduced its complexity toOn2k+nk2. In 2009, Peter Lory reduced its complexity to On2k. A new protocol is presented in our paper, which reduces this complexity further to Onklog2k. It is better than Gennaro protocol unconditionally. And as to Peter Lory protocol, the reduction is profitable in situation where log2k is smaller than n.

Abstract: With rapid development of integrated circuit technologies, power consumption has been a key factor for long time, beside speed and area. Currently, in order to obtain the optimal low power result, we try to reduce system power consumption in each stage of integrated circuit design. Base on the traditional methodologies, a dual optimization methodology is developed, which reduces not only the number of addition operations, but also the width of one multiplier. From implementation point of view, the result of first optimization can be used for the second one, such implementation save the computation effort of second optimization, and promote operation speed and efficiency of whole methodology. The dissertation develop the low power technique for multipliers in different stages, it has reference value to integrated circuit front-end low power design for fixed coefficient multipliers.