Abstract. GLV curves (Gallant et al.) have performance advantages over standard elliptic curves, using half the number of point doublings for scalar multiplication. Despite their introduction in 2001, implemen-tations of the GLV method have yet to permeate widespread software libraries. Furthermore, side-channel vulnerabilities, specifically cache-timing attacks, remain unpatched in the OpenSSL code base since the first attack in 2009 (Brumley and Hakala) even still after the most recent attack in 2014 (Benger et al.). This work reports on the integration of the GLV method in OpenSSL for curves from 160 to 256 bits, as well as deploying and evaluating two side-channel defenses. Performance gains are up to 51%, and with these improvements GL...
This thesis deals with two topics: elliptic-curve cryptography and code-based cryptography. In 2007 ...
It is widely accepted that public-key cryptosystems play a major role in the security arena of the I...
Abstract. The fundamental operation in elliptic curve cryptographic schemes is the multiplication of...
Point multiplication is the dominant operation in elliptic curve cryptosystems. Many techniques are ...
We propose efficient algorithms and formulas that improve the performance of side channel protected ...
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be ac-ce...
We propose efficient algorithms and formulas that improve the performance of side-channel protected ...
This paper accelerates FPGA computations of discrete logarithms on elliptic curves over binary field...
Historically, Elliptic Curve Cryptography (ECC) is an active field of applied cryptography where rec...
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pus...
We illustrate a vulnerability introduced to elliptic curve cryptographic protocols when implemented ...
In this article we present how we can use fast F_{p²} multiplication to speed-up arithmetic on ellip...
In [2], Gallant, Lambert and Vanstone proposed a very efficient algorithm to compute Q = kP on ellip...
This paper explores the potential for using genus~2 curves over quadratic extension fields in crypto...
GLS254 is an elliptic curve defined over a finite field of characteristic 2; it contains a 253-bit p...
This thesis deals with two topics: elliptic-curve cryptography and code-based cryptography. In 2007 ...
It is widely accepted that public-key cryptosystems play a major role in the security arena of the I...
Abstract. The fundamental operation in elliptic curve cryptographic schemes is the multiplication of...
Point multiplication is the dominant operation in elliptic curve cryptosystems. Many techniques are ...
We propose efficient algorithms and formulas that improve the performance of side channel protected ...
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be ac-ce...
We propose efficient algorithms and formulas that improve the performance of side-channel protected ...
This paper accelerates FPGA computations of discrete logarithms on elliptic curves over binary field...
Historically, Elliptic Curve Cryptography (ECC) is an active field of applied cryptography where rec...
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pus...
We illustrate a vulnerability introduced to elliptic curve cryptographic protocols when implemented ...
In this article we present how we can use fast F_{p²} multiplication to speed-up arithmetic on ellip...
In [2], Gallant, Lambert and Vanstone proposed a very efficient algorithm to compute Q = kP on ellip...
This paper explores the potential for using genus~2 curves over quadratic extension fields in crypto...
GLS254 is an elliptic curve defined over a finite field of characteristic 2; it contains a 253-bit p...
This thesis deals with two topics: elliptic-curve cryptography and code-based cryptography. In 2007 ...
It is widely accepted that public-key cryptosystems play a major role in the security arena of the I...
Abstract. The fundamental operation in elliptic curve cryptographic schemes is the multiplication of...