FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field

Authors:
Hao Li;Jian Huang;Philip Sweany;Dijiang Huang
Affiliations:
University of North Texas, Department of Computer Science and Engineering, P.O. Box 311366, Denton, TX 76203, USA;School of Electrical Engineering and Computer Science, University of Central Florida, 4000 Central Florida Blvd., Orlando, FL 32816, USA;University of North Texas, Department of Computer Science and Engineering, P.O. Box 311366, Denton, TX 76203, USA;Department of Computer Science and Engineering, Arizona State University Tempe, AZ 85287, USA
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2008

Citing 25
Cited 5

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Reducing elliptic curve logarithms to logarithms in a finite field

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Low-Energy Digit-Serial/Parallel Finite Field Multipliers

Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Performance analysis of elliptic curve cryptography for SSL

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Designs, Codes and Cryptography
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis

IEEE Transactions on Computers
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Use of Elliptic Curves in Cryptography

CRYPTO '85 Advances in Cryptology
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable Dual-Field Elliptic Curve Cryptographic Processor

IEEE Transactions on Computers
FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor

FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
A High Performance VLIW Processor for Finite Field Arithmetic

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Rapid Prototyping for Hardware Accelerated Elliptic Curve Public-Key Cryptosystems

RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
On the Hardware Design of an Elliptic Curve Cryptosystem

ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Efficient Implementation of Pairing-Based Cryptosystems

Journal of Cryptology
A Parallelized Design for an Elliptic Curve Cryptosystem Coprocessor

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Security in Computing (4th Edition)

Security in Computing (4th Edition)
High-speed hardware implementations of Elliptic Curve Cryptography: A survey

Journal of Systems Architecture: the EUROMICRO Journal
Hardware architectures of elliptic curve based cryptosytems over binary fields

Hardware architectures of elliptic curve based cryptosytems over binary fields
Elliptic curve cryptography-based access control in sensor networks

International Journal of Security and Networks
Efficient tate pairing computation for elliptic curves over binary fields

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers

CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
FPGA and ASIC implementations of the ηT pairing in characteristic three

Computers and Electrical Engineering
Toward development of high secure sensor network nodes using an FPGA-based architecture

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Network-on-Chip interconnect for pairing-based cryptographic IP cores

Journal of Systems Architecture: the EUROMICRO Journal
A reconfigurable implementation of the tate pairing computation over GF(2m)*

ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic schemes that become popular in recent years. ECC offers a smaller key size compared to traditional methods without sacrificing security level. Tate pairing is a bilinear map commonly used in identity-based cryptographic schemes. Therefore, it is more attractive to implement these schemes by using hardware than by using software because of its computational expensiveness. In this paper, we propose field programmable gate array (FPGA) implementations of the elliptic curve point multiplication in Galois field GF(2^2^8^3) and Tate pairing computation in GF(2^2^8^3). Experimental results demonstrate that, compared with previously proposed approaches, our FPGA implementations of ECC and Tate pairing can speed up by 31.6 times and 152 times, respectively.