Integer Sub-Decomposition (Isd) Method For Elliptic Curve Scalar Multiplication
Dalam kajian ini, kaedah baru yang dipanggil sub-peleraian integer (ISD) berdasarkan prinsip Gallant, Lambert dan Vanstone (GLV) bagi mengira perkalian skalar kP berbentuk lengkung elips E melebihi kawasan terbatas utama Fp yang mempunyai pengiraan endomorphisms ψj yang efisyen bagi j = 1; 2, men...
Saved in:
Main Author: | Ajeena, Ruma Kareem K. |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://eprints.usm.my/32317/1/RUMA_KAREEM_K._AJEENA.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Construction Of Efficiently
Computable Endomorphisms For
Scalar Multiplication On Some
Elliptic Curves
by: Antony, Siti Noor Farwina Mohamad Anwar
Published: (2019) -
Improvement scalar multiplication in elliptic curve cryptography
by: Tao, Sui
Published: (2014) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015) -
A scalar multiplication in elliptic curve cryptography with binary polynomial operations in galois field /
by: Modares, Hero
Published: (2009) -
New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
by: Eghdamian, Arash
Published: (2020)