À propos de cet article

Citez

In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compellProjCo and addellProjCo are unary and binary operations of a point over the elliptic curve.

eISSN:
1898-9934
ISSN:
1426-2630
Langue:
Anglais
Périodicité:
4 fois par an
Sujets de la revue:
Computer Sciences, other, Mathematics, General Mathematics