Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Architectures for exponentiation in GF (2n)
Proceedings on Advances in cryptology---CRYPTO '86
Proceedings on Advances in cryptology---CRYPTO '86
VICTOR: an efficient RSA hardware implementation
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation
IEEE Transactions on Computers - Special issue on computer arithmetic
VLSI array algorithms and architectures for RSA modular multiplication
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Computer arithmetic: algorithms and hardware designs
Computer arithmetic: algorithms and hardware designs
The State of Elliptic Curve Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
A Fast Modular-multiplication Algorithm based on a Higher Radix
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Faster Modular Multiplication by Operand Scaling
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Selecting Cryptographic Key Sizes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
An Energy Efficient Reconfigurable Public-Key Cryptograhpy Processor Architecture
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
A Computer Algorithm for Calculating the Product AB Modulo M
IEEE Transactions on Computers
The RSA cryptography processor
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Dual-Field Arithmetic Unit for GF(p) and GF(2m)
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A high-performance unified-field reconfigurable cryptographic processor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
FPGA based unified architecture for public key and private key cryptosystems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
The performance of elliptic curve cryptosystems is primarily determined by an efficient implementation of the arithmetic operations in the underlying finite field. This paper presents a hardware architecture for a unified multiplier which operates in two types of finite fields: GF(p) and GF(m). In both cases, the multiplication of field elements is performed by accumulation of partial-products to an intermediate result according to an MSB-first shift-and-add method. The reduction modulo the prime p (or the irreducible polynomial p(t), respectively) is interleaved with the addition steps by repeated subtractions of 2p and/or p (or p(t), respectively). A bit-serial multiplier executes a multiplication in GF(p) in approximately 1.5ċ⌈log2(p)⌉ clock cycles, and the multiplication in GF(m) takes exactly m clock cycles. The unified multiplier requires only slightly more area than that of the multiplier for prime fields GF(p). Moreover, it is shown that the proposed architecture is highly regular and simple to design.