RSA public-key cryptography and some other algorithms require various modular arithmetic operations. This paper presents an area efficient modulararithmetic processor. The operands can vary in size from 256 to 2048 b...
详细信息
ISBN:
(纸本)078037889X
RSA public-key cryptography and some other algorithms require various modular arithmetic operations. This paper presents an area efficient modulararithmetic processor. The operands can vary in size from 256 to 2048 bits. Optimized CIOS algorithm is introduced to speed up modular multiplication. At a maximum clock rate of 60 MHz, it takes 57 ms to complete a 1024-bit modular exponentiation. The core circuit without RAM contains 16000 gates and the whole area measures only 3.31 mm(2) in a 0.35-mum CMOS technology. As a coprocessor, it is suitable for embedded systems, especially in area-constrained environments such as smart cards.
A method for error control in the modular number system (MNS) based on the use of the zeroing procedure is proposed. This method is designed to verify the correct implementation of the computing process of computer sy...
详细信息
ISBN:
(纸本)9781538666111
A method for error control in the modular number system (MNS) based on the use of the zeroing procedure is proposed. This method is designed to verify the correct implementation of the computing process of computer systems and components. It is assumed that the error in one module remainder does not affect the residual values corresponding to other modules (bases) of the MNS. The essence of the proposed method is that, when performing the procedure of zeroing in the MNS, the operation of determining is combined in time, in accordance with the corresponding digits of the number A, the zeroing constant and the calculation operation for the corresponding values of the digits of the number A. This makes it possible to increase the efficiency of monitoring information presented in the modular number system.
Two new algorithms that facilitate the implementation of RSA in software are described. Both algorithms are essentially concerned with performing modular arithmetic operations on very large numbers, which could be of ...
详细信息
Two new algorithms that facilitate the implementation of RSA in software are described. Both algorithms are essentially concerned with performing modular arithmetic operations on very large numbers, which could be of potential use to applications other than RSA. One algorithm performs modular reduction and the other performs modular multiplication. Both algorithms are based on the use of look-up tables to enable the arithmetic computations to be done on a byte by byte basis.
Cloud services using secret sharing schemes have been launched recently. Since secret sharing schemes have been usually achieved over a finite field, the throughput for sharing and reconstructing a secret depends on t...
详细信息
ISBN:
(纸本)9781538657904
Cloud services using secret sharing schemes have been launched recently. Since secret sharing schemes have been usually achieved over a finite field, the throughput for sharing and reconstructing a secret depends on the implementation of finite field operations. However, almost all the CPUs do not support finite-field operations as primary instructions. We study k-out of-n secret sharing schemes using the linear transform over Z(2)(m). The advantage of the linear transform over Z(2)(m) is that almost all the CPUs support a modulo-2(m) addition, a modulo 2(m) subtraction, and a modulo-2(m) multiplication as primary instructions. We show the conditions of an encoding matrix to achieve the k-out-of-n secret sharing scheme based on the linear transform over Z(2)(m). The conditions suggest that the k-out-of-n secret sharing scheme over Z(2)(m) is non-ideal. We also show the maximum size of a secret if the Vandermonde matrix whose all the elements are a power of two is used as the encoding matrix.
暂无评论