Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Elliptic Curve Cryptosystems
CRYPTO '97 Proceedings of the 17th 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 Key Exchange with Elliptic Curve Systems
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Elliptic Curve Cryptography on a Palm OS Device
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Elliptic Curve Arithmetic Using SIMD
ISC '01 Proceedings of the 4th International Conference on Information Security
On Montgomery-Like Representationsfor Elliptic Curves over GF(2k)
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
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 Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
The Hessian Form of an Elliptic Curve
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded 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
Montgomery Ladder for All Genus 2 Curves in Characteristic 2
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
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
A high-performance unified-field reconfigurable cryptographic processor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Designs, Codes and Cryptography
Design of flexible GF(2m) elliptic curve cryptography processors
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design and evaluation of parallel, scalable, curve based processor over binary field
WSEAS Transactions on Computers
FPGA implementation of point multiplication on koblitz curves using kleinian integers
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Virtualization within a parallel array of homogeneous processing units
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Efficient arithmetic on hessian curves
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Exploring the design space of prime field vs. binary field ECC-Hardware implementations
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Low power elliptic curve cryptography
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
Faster implementation of scalar multiplication on koblitz curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Computers and Electrical Engineering
Securing ZigBee smart energy profile 1.x with OpenECC library
Proceedings of the first ACM workshop on Smart energy grid security
Lambda coordinates for binary elliptic curves
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
Quantum Information & Computation
| Hi-index | 0.00 |
This paper describes three contributions for efficient implementation of elliptic curve cryptosystems in GF(2n). The first is a new method for doubling an elliptic curve point, which is simpler to implement than the fastest known method, due to Schroeppel, and which favors sparse elliptic curve coefficients. The second is a generalized and improved version of the Guajardo and Paar's formulas for computing repeated doubling points. The third contribution consists of a new kind of projective coordinates that provides the fastest known arithmetic on elliptic curves. The algorithms resulting from this new formulation lead to a running time improvement for computing a scalar multiplication of about 17% over previous projective coordinate methods.