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

The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF(2 m ). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Wherek is an integer and P is a point on an elliptic curve. The EC Point multiplication processor defined in affine coordinates is achieved by using a dedicated Galois Field arithmetic implemented on FPGA using VHDL language.

Hardware Implementation of Elliptic Curve Point Multiplication over GF(2m) for ECC protocols