Advances in Applied Mathematics
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Checking Before Output May Not Be Enough Against Fault-Based Cryptanalysis
IEEE Transactions on Computers
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Exceptional Procedure Attackon Elliptic Curve Cryptosystems
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
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
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
Finite Fields and Their Applications
A nagell algorithm in any characteristic
Cryptography and Security
High-Speed unified elliptic curve cryptosystem on FPGAs using binary huff curves
VDAT'12 Proceedings of the 16th international conference on Progress in VLSI Design and Test
On the implementation of unified arithmetic on binary huff curves
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
This paper describes the addition law for a new form for elliptic curves over fields of characteristic 2. Specifically, it presents explicit formulæ for adding two different points and for doubling points. The case of differential point addition (that is, point addition with a known difference) is also addressed. Finally, this paper presents unified point addition formulæ; i.e., point addition formulæ that can be used for doublings. Applications to cryptographic implementations are discussed.