A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Exponentiation cryptosystems on the IBM PC
IBM Systems Journal
Limits of instruction-level parallelism
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Hitting the memory wall: implications of the obvious
ACM SIGARCH Computer Architecture News
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
Designs, Codes and Cryptography
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
High-Speed Software Multiplication in F2m
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Elliptic Scalar Multiplication Using Point Halving
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Five, Six, and Seven-Term Karatsuba-Like Formulae
IEEE Transactions on Computers
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
A note on window τ-NAF algorithm
Information Processing Letters
Affine precomputation with sole inversion in elliptic curve cryptography
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Another look at square roots (and other less common operations) in fields of even characteristic
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Efficient techniques for high-speed elliptic curve cryptography
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Efficient software implementation of binary field arithmetic using vector instruction sets
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Field inversion and point halving revisited
IEEE Transactions on Computers
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication
Information Processing Letters
Faster implementation of scalar multiplication on koblitz curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Four-Dimensional gallant-lambert-vanstone scalar multiplication
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 0.00 |
The availability of a new carry-less multiplication instruction in the latest Intel desktop processors significantly accelerates multiplication in binary fields and hence presents the opportunity for reevaluating algorithms for binary field arithmetic and scalar multiplication over elliptic curves. We describe how to best employ this instruction in field multiplication and the effect on performance of doubling and halving operations. Alternate strategies for implementing inversion and half-trace are examined to restore most of their competitiveness relative to the new multiplier. These improvements in field arithmetic are complemented by a study on serial and parallel approaches for Koblitz and random curves, where parallelization strategies are implemented and compared. The contributions are illustrated with experimental results improving the state-of-the-art performance of halving and doubling-based scalar multiplication on NIST curves at the 112- and 192-bit security levels, and a new speed record for side-channel resistant scalar multiplication in a random curve at the 128-bit security level.