
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Elliptic curve cryptography (ECC) is mainly an
alternative to traditional publickey cryptosystems (PKCs),
such as RSA, due to its smaller key size with same security
level for resourceconstrained networks. The computational
efficiency of ECC depends on the scalar point multiplication,
which consists of modular point addition and point doubling
operations. The paper emphasizes on point multiplication
techniques such as Binary, NAF, wNAF and different
coordinate systems like Affine and Projective (Standard
Projective, Jacobian and Mixed) for point addition and doubling
operations. These operations are compared based on execution
time. The results given here are for general purpose processor
with 1:73 GH z frequency. The implementation is done over
NISTrecommended prime fields 192/224/256/384/521.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment