English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Elliptic Curve Cryptography was introduced by Neal Koblitz and Victor Miller in 1985. The reason why is so attractive is that there is no known efficient algorithm to solve the logarithm problem. Is very important to improve the running time of the algorithms used for elliptic curve implementation. Therefore, in this article are described the basic algorithms for point multiplication in an elliptic curve. As the reading progresses, improved techniques are introduced and information is provided to know how to efficiently implement these methods with real parameter.

Algoritmos Basicos Para La Multiplicacion De Puntos En Una Curva Eliptica