VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases
IEEE Transactions on Computers
A New Algorithm for Multiplication in Finite Fields
IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
IEEE Transactions on Computers
Design, Implementation and Performance Evaluation of IP-VPN
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Performance evaluation of software virtual private networks (VPN)
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Hi-index | 0.00 |
It has become increasingly common to implement discrete-algorithm based public-key protocols on elliptic curves over finite fields. The operations, especially multiplication, over finite fields affect greatly the speed of encryption/decryption. For this reason the contribution describes a fast multiplier for Elliptic Curve Cryptosystems over finite fields GF ((2m1)m2). This multiplier adopts mixed parallel-serial approaches., The number of clock cycles for one field multiplication can be reduced from former m= m2m1 to current m2 with less increase of hardware scales.