Elliptic curve cryptography recently gained a lot attention in industry. The performance of elliptic curve cryptosystem heavily depends on an operation called point multiplication. Here we proposed a new point multiplication method using modified base representation. We devised two algorithms for the method and analyzed the complexity of the method. The proposed method reduces the point addition as well as the point doubling. We showed that the method is faster than the widely used window method.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados