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
An algorithm for modular exponentiation
Information Processing Letters
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinataes
Information Processing Letters
A New Addition Formula for Elliptic Curves over GF(2^n)
IEEE Transactions on Computers
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
High Performance FPGA based Elliptic Curve Cryptographic Co-Processor
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
A cryptographic processor for arbitrary elliptic curves over GF(2m)
A cryptographic processor for arbitrary elliptic curves over GF(2m)
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
An analysis of double base number systems and a sublinear scalar multiplication algorithm
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
A microcoded elliptic curve processor using FPGA technology
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
FPGA Design of Self-certified Signature Verification on Koblitz Curves
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Fast point multiplication on Koblitz curves: Parallelization method and implementations
Microprocessors & Microsystems
On parallelization of high-speed processors for elliptic curve cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
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
A graph theoretic analysis of double base number systems
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Koblitz curves and integer equivalents of frobenius expansions
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Scalar multiplication on koblitz curves using double bases
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Extended double-base number system with applications to elliptic curve cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
ISC'07 Proceedings of the 10th international conference on Information Security
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k = ∑±τa (τ–1)b and k= ∑±τa (τ–1)b (τ2 – τ– 1)c. We prove that the number of terms in the second type is sublinear in the bit length of k, which leads to the first provably sublinear point multiplication algorithm on Koblitz curves. For the first type, we conjecture that the number of terms is sublinear and provide numerical evidence demonstrating that the number of terms is significantly less than that of τ-adic non-adjacent form expansions. We present details of an innovative FPGA implementation of our algorithm and performance data demonstrating the efficiency of our method.