Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Elliptic curves in cryptography
Elliptic curves in cryptography
Handbook of Applied Cryptography
Handbook of Applied Cryptography
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Fast Software Implementation for Arithmetic Operations in GF(2n)
ASIACRYPT '96 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
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Workload Characterization of a Lightweight SSL Implementation Resistant to Side-Channel Attacks
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
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
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Efficient software implementations of large finite fields GF(2n) for secure storage applications
ACM Transactions on Storage (TOS)
High-speed parallel software implementation of the ηT pairing
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
High speed implementation of authenticated encryption for the MSP430X microcontroller
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Securing ZigBee smart energy profile 1.x with OpenECC library
Proceedings of the first ACM workshop on Smart energy grid security
Reordering computation sequences for memory-efficient binary field multiplication
The Journal of Supercomputing
Screaming fast Galois field arithmetic using intel SIMD instructions
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
In this paper we describe an efficient algorithm for multiplication in F2m, where the field elements of F2m are represented in standard polynomial basis. The proposed algorithm can be used in practical software implementations of elliptic curve cryptography. Our timing results, on several platforms, show that the new method is significantly faster than the "shift-and-add" method.