Integer Sub-Decomposition (Isd)
Method For Elliptic Curve
Scalar Multiplication

QR Code

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...

Full description

Bibliographic Details
Main Author:	Ajeena, Ruma Kareem K.
Format:	Thesis
Language:	English
Published:	2015
Subjects:	QA1 Mathematics (General)
Online Access:	http://eprints.usm.my/32317/ http://eprints.usm.my/32317/1/RUMA_KAREEM_K._AJEENA.pdf

Similar Items

Signed decomposition method for scalar multiplication in elliptic curve cryptography
by: Md. Said, Mohamad Rushdan, et al.
Published: (2010)

The Construction Of Efficiently Computable Endomorphisms For Scalar Multiplication On Some Elliptic Curves
by: Antony, Siti Noor Farwina Mohamad Anwar
Published: (2019)

High performance methods of elliptic curve scalar multiplication
by: Al Saffar, Najlae Falah Hameed, et al.
Published: (2014)

An improved binary method for scalar multiplication in elliptic curve cryptography
by: Mohamed, Mohamad Afendee, et al.
Published: (2010)

Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015)

Elliptic net scalar multiplication upon Koblitz curves
by: Muslim, Norliana, et al.
Published: (2020)

An algorithm to enhance elliptic curves scalar multiplication combining MBNR with point halving
by: M. Ismail, Abdulwahed, et al.
Published: (2010)

New Representation Method For Integers And Its Application On Elliptic Curve Cryptography
by: Eghdamian, Arash
Published: (2020)

Improving the performance of {0,1,3}-NAF recoding algorithm for elliptic curve scalar multiplication
by: Abdul Raheem, Waleed K., et al.
Published: (2019)

Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form
by: Al Saffar, Najlae Falah Hameed, et al.
Published: (2015)

Generalizing equivalent elliptic divisibility sequence for elliptic net scalar multiplication
by: Muslim, Norliana, et al.
Published: (2018)

Scalar multiplication via elliptic nets with application to cryptography
by: Muslim, Norliana, et al.
Published: (2018)

Elliptic net scalar multiplication using generalized equivalent elliptic divisibility sequence
by: Muslim, Norliana, et al.
Published: (2018)

A lightweight and secure algorithm of elliptic curve cryptography scalar multiplication using Q-NAF method in Lopez-Dahab coordinate
by: Abdulraheem, Waleed Khalid Amin
Published: (2019)

New signed-digit {0,1,3}-NAF scalar multiplication algorithm for elliptic curve over binary field
by: Md Yasin, Sharifah
Published: (2011)

Fast endomorphisms in integer sub-decomposition method on Secp192k1
by: Antony, S.N.F.M.A., et al.
Published: (2024)

Key exchange in elliptic curve cryptography based on the decomposition problem
by: Hilyati Hanina Zazali,, et al.
Published: (2012)

On the equiconvergence of the spectral decomposition of the distributions connected with elliptic differential operators on the torus with Fourier integral
by: Akhmedov, Abdulkasim, et al.
Published: (2021)

On some patterns of TNAF for scalar multiplication over Koblitz curve
by: Yunos, Faridah, et al.
Published: (2022)

Improved scalar multiplication algorithm in affine coordinate system using elliptic net
by: Razali, Zuren, et al.
Published: (2022)

Enhanced scalar multiplication algorithm over prime field using elliptic net
by: Muslim, Norliana, et al.
Published: (2024)

Pseudo T - adic non adjacent form for scalar multiplication on Koblitz Curves
by: Yunos, Faridah, et al.
Published: (2015)

The Importance of Transparency for Legitimising ISDS: An Australian Perspective
by: Douglas, Michael
Published: (2015)

Pseudo τ - adic non adjacent form for scalar multiplication on Koblitz curves
by: Yunos, Faridah, et al.
Published: (2015)

Pseudo τ-adic non adjacent form for scalar multiplication on Koblitz Curves
by: Yunos, Faridah, et al.
Published: (2015)

Pseudo τ - adic non adjacent form for scalar multiplication on Koblitz curves
by: Yunos, Faridah, et al.
Published: (2014)

Multi-Threading Elliptic Curve Cryptosystems.
by: Kanniah, Uma S., et al.
Published: (2007)

ZOT -Mk: A New Algorithm For Big Integer Multiplication
by: Jahani, Shahram
Published: (2009)

On the Improvement of Addition Chain in Applications to Elliptic Curve Cryptosystem Status: Submitted
by: Mohamed, Mohamad Afendee
Published: (2011)

Improved algorithms of elliptic curve point multiplication over binary and prime fields using elliptic net
by: Muslim, Norliana
Published: (2022)

Enhancement of {0, 1, 3}-NAF Recoding Algorithm using Block Method Technique for Elliptic Curve Cryptosystem
by: Bafandehkar, Mohsen
Published: (2015)

Improvement to scalar multiplication on Koblitz curves by using pseudo τ-adic non-adjacent form
by: Yunos, Faridah, et al.
Published: (2015)

A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
by: Hilyati Hanina, Zazali
Published: (2012)

Equiconvergence in summation associated with elliptic polinomial
by: Fargana, A, et al.
Published: (2017)

Integer Factorization Algorithms
by: Hasan, Nor Azuani
Published: (2010)

Choices on designing GF (p) elliptic curve coprocessor benefiting from mapping homogeneous curves in parallel multiplications
by: Al-Haija, Qasem Abu, et al.
Published: (2011)

Shorter addition chain for smooth integers using decomposition method.
by: Mohamed, M. A., et al.
Published: (2011)

MSG352 - Linear and Integer Programming (Pengaturcaraan Linear dan Integer)-Disember 2019
by: PPSM, Pusat Pengajian Sains Matematik
Published: (2019)

Numerical modular symbols for elliptic curves
by: Wuthrich, Christian
Published: (2017)

Anabelian geometry of punctured elliptic curves
by: Porowski, Wojciech
Published: (2020)