FPGA Design of Self-certified Signature Verification on Koblitz Curves

Authors:
Kimmo Järvinen;Juha Forsten;Jorma Skyttä
Affiliations:
Helsinki University of Technology, Signal Processing Laboratory, Otakaari 5A, FIN-02150, Espoo, Finland;Helsinki University of Technology, Signal Processing Laboratory, Otakaari 5A, FIN-02150, Espoo, Finland;Helsinki University of Technology, Signal Processing Laboratory, Otakaari 5A, FIN-02150, Espoo, Finland
Venue:
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Year:
2007

Citing 13
Cited 1

VLSI Architectures for Computing Multiplications and Inverses in GF(2m)

IEEE Transactions on Computers
Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
A new signature scheme based on the DSA giving message recovery

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Efficient Arithmetic on Koblitz Curves

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
A New Addition Formula for Elliptic Curves over GF(2^n)

IEEE Transactions on Computers
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)

SAC '98 Proceedings of the Selected Areas in Cryptography
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Left-to-Right signed-bit τ-adic representations of n integers

ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
FPGA implementation of point multiplication on koblitz curves using kleinian integers

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Efficient representations on koblitz curves with resistance to side channel attacks

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

Towards understanding pure publish/subscribe cryptographic protocols

Security'08 Proceedings of the 16th International conference on Security protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elliptic curve signature schemes offer shorter signatures compared to other methods and a family of curves called Koblitz curves can be used for reducing the cost of signing and verification. This paper presents an FPGA implementation designed specifically for rapid verification of self-certified identity based signatures using Koblitz curves. Verification requires computation of three elliptic curve point multiplications which are computed efficiently with 3-term multiple point multiplication and joint sparse form. Certain improvements to precomputations associated with multiple point multiplications are introduced. It is shown that, when using parallel processors, it is possible to gain considerable increases in the number of operations per second by allowing slightly longer computation times for single operations. It is demonstrated that up to 166,000 verifications per second can be computed using a single Altera Stratix II FPGA.