Cite

In this article, we formalize in Mizar [1], [2] a binary operation of points on an elliptic curve over GF(p) in affine coordinates. We show that the operation is unital, complementable and commutative. Elliptic curve cryptography [3], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security.

eISSN:
1898-9934
ISSN:
1426-2630
Idioma:
Inglés
Calendario de la edición:
Volume Open
Temas de la revista:
Computer Sciences, other, Mathematics, General Mathematics