The Construction Of Efficiently Computable Endomorphisms For Scalar Multiplication On Some Elliptic Curves
Elliptic curves scalar multiplication (ECSM), denoted as kP, is one of the building blocks in Elliptic Curve Cryptography (ECC). An elliptic curve, E defined over a finite prime field, Fp have finitely many points which form an abelian group and there exists a prime subgroup with order n. ECSM in...
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.usm.my/50164/1/FINAL%20THESIS-SITI%20NOOR%20FARWINA24.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Elliptic curves scalar multiplication (ECSM), denoted as kP, is one of the building
blocks in Elliptic Curve Cryptography (ECC). An elliptic curve, E defined over
a finite prime field, Fp have finitely many points which form an abelian group and
there exists a prime subgroup with order n. ECSM involves the multiplication of scalar
k 2 [1;n |
---|