Add to ORKGAbstract—Three algorithms for double-scalar multiplication on elliptic curves, based on the representations of a pair of integers as mixed powers of 2 and 3, are presented. I
Elliptic curve cryptography has gained much popularity in the past decade and has been challenging t...
In the current work we propose two efficient formulas for computing the 5-fold (5P) of an elliptic c...
Elliptic curves (EC) scalar multiplication over some finite fields, is an attractive research area, an...
Abstract. In this paper we propose to take one step back in the use of double base number systems fo...
Among the various arithmetic operations required in implementing public key cryptographic algorithm...
Elliptic curves scalar multiplication over finite fields has become a highly active research area. T...
Elliptic curve scalar multiplication is the operation of successively adding a point along an ellipt...
In this work, we propose an algorithm to produce the double-base chain that optimizes the time used ...
Efficient and secure public-key cryptosystems are essential in today’s age of rapidly growing Intern...
Efficient and secure public-key cryptosystems are essential in today’s age of rapidly growing Intern...
Abstract. The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any in...
We address several algorithms to perform a double-scalar multiplication on an elliptic curve. All th...
Abstract—We address several algorithms to perform a double-scalar multiplication on an elliptic curv...
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A...
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scala...
Elliptic curve cryptography has gained much popularity in the past decade and has been challenging t...
In the current work we propose two efficient formulas for computing the 5-fold (5P) of an elliptic c...
Elliptic curves (EC) scalar multiplication over some finite fields, is an attractive research area, an...
Abstract. In this paper we propose to take one step back in the use of double base number systems fo...
Among the various arithmetic operations required in implementing public key cryptographic algorithm...
Elliptic curves scalar multiplication over finite fields has become a highly active research area. T...
Elliptic curve scalar multiplication is the operation of successively adding a point along an ellipt...
In this work, we propose an algorithm to produce the double-base chain that optimizes the time used ...
Efficient and secure public-key cryptosystems are essential in today’s age of rapidly growing Intern...
Efficient and secure public-key cryptosystems are essential in today’s age of rapidly growing Intern...
Abstract. The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any in...
We address several algorithms to perform a double-scalar multiplication on an elliptic curve. All th...
Abstract—We address several algorithms to perform a double-scalar multiplication on an elliptic curv...
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A...
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scala...
Elliptic curve cryptography has gained much popularity in the past decade and has been challenging t...
In the current work we propose two efficient formulas for computing the 5-fold (5P) of an elliptic c...
Elliptic curves (EC) scalar multiplication over some finite fields, is an attractive research area, an...