Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
IEEE Transactions on Computers - Special issue on computer arithmetic
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
SAC '98 Proceedings of the Selected Areas in Cryptography
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
An End-to-End Systems Approach to Elliptic Curve Cryptography
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
FPGA implementation of high performance elliptic curve cryptographic processor over GF(2163)
Journal of Systems Architecture: the EUROMICRO Journal
On parallelization of high-speed processors for elliptic curve cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient time-area scalable ECC processor using µ-coding technique
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Hi-index | 0.00 |
The design of flexible elliptic curve cryptography processors (ECP) is considered in this paper. Novel word-level algorithms and implementations for the underlying GF(2m) multiplication and squaring arithmetic which enable improved flexibility versus performance tradeoffs, are presented and employed in the design of an efficient flexible ECP architecture; corresponding field-programmable gate-array (FPGA) prototyping results for two different processor word lengths are also included for evaluation.