Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
Exponential sums over Galois rings and their applications
FFA '95 Proceedings of the third international conference on Finite fields and applications
Finite Commutative Rings and Their Applications
Finite Commutative Rings and Their Applications
Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code
IEEE Transactions on Information Theory
Homogeneous weights and exponential sums
Finite Fields and Their Applications
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
A Tree-Based Approach for Computing Double-Base Chains
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Double-Base Number System for Multi-scalar Multiplications
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Delaying and merging operations in scalar multiplication: applications to curve-based cryptosystems
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Encapsulated scalar multiplications and line functions in the computation of Tate pairing
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Affine precomputation with sole inversion in elliptic curve cryptography
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Generalized MMM-algorithm secure against SPA, DPA, and RPA
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
A graph theoretic analysis of double base number systems
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Efficient window-based scalar multiplication on elliptic curves using double-base number system
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Fast scalar multiplication for ECC over GF(p) using division chains
WISA'10 Proceedings of the 11th international conference on Information security applications
An efficient mobile PACE implementation
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Extended double-base number system with applications to elliptic curve cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient scalar multiplication by isogeny decompositions
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Group law computations on jacobians of hyperelliptic curves
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Improved precomputation scheme for scalar multiplication on elliptic curves
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Fast point quadrupling on elliptic curves
Proceedings of the Third Symposium on Information and Communication Technology
The tate pairing via elliptic nets
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
ISC'07 Proceedings of the 10th international conference on Information Security
Improved exponentiation and key agreement in the infrastructure of a real quadratic field
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
A new algorithm for computing triple-base number system
ACM SIGARCH Computer Architecture News
Arithmetic unit for computations in GF(p) with the left-shifting multiplicative inverse algorithm
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Information Sciences: an International Journal
| Hi-index | 0.00 |
Recently, Eisenträger et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S=(2P + Q) from given points P and Q on an elliptic curve. Compared to the naive approach, the improved formulas save a field multiplication each time the operation is performed. This paper proposes a variant which is faster whenever a field inversion is more expensive than six field multiplications. We also give an improvement when tripling a point, and present a ternary/binary method to perform efficient scalar multiplication.