Hardware Implementation of Montgomery's Modular Multiplication Algorithm
IEEE Transactions on Computers
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
VHDL: Analysis and Modeling of Digital Systems
VHDL: Analysis and Modeling of Digital Systems
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Efficient pre-processing for large window-based modular exponentiation using genetic algorithms
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
| Hi-index | 0.00 |
Smart cards use integrated circuits instead of magnetic tape. Its architecture includes a processor, memory, input/output and, possibly, a cryptographic coprocessor. The cost of smart cards is directly related to the size of the integrated circuit. Our present focus is the cryptographic coprocessor, which usually uses a public-key cryptosystem. In these cryptosystems, the main operation is the modular exponentiation, which is performed using successive modular multiplications. This operation is time consuming for large operands, which is always the case in cryptography. Here, performance is another matter of concern. For fast software or hardware cryptosystems, one needs thus to reduce the total number of modular multiplications required. In this paper, we propose a fast and compact hardware for computing modular exponentiation using the m-ary methods, applying the addition chain method for the pre-processing step. The cryptographic hardware is low-cost and concise, offering a good solution for smart cards.