Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Discrete Applied Mathematics
Implementing elliptic curve cryptography
Implementing elliptic curve cryptography
Storage-Efficient Finite Field Basis Conversion
SAC '98 Proceedings of the Selected Areas in Cryptography
Fast Normal Basis Multiplication Using General Purpose Processors
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
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
Efficient Finite Field Basis Conversion Involving Dual Bases
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Fast Normal Basis Multiplication Using General Purpose Processors
IEEE Transactions on Computers
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three
IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
WG: A family of stream ciphers with designed randomness properties
Information Sciences: an International Journal
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Customizable elliptic curve cryptosystems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the (im)possibility of practical and secure nonlinear filters and combiners
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Finite field arithmetic using quasi-normal bases
Finite Fields and Their Applications
| Hi-index | 0.01 |
Finite field arithmetic is becoming increasingly important in today's computer systems, particularly for implementing cryptographic operations. Among various arithmetic operations, finite field multiplication is of particular interest since it is a major building block for elliptic curve cryptosystems. In this paper, we present new techniques for efficient software implementation of binary field multiplication in normal basis. Our techniques are more efficient in terms of both speed and memory compared with alternative approaches.