High performance methods of elliptic curve scalar multiplication

High performance methods of elliptic curve scalar multiplication

Elliptic curve scalar multiplication is the operation of successively adding a point along an elliptic curve to itself k times. It is used in elliptic curve cryptography (ECC) as a means of producing a trapdoor function. In this paper, algorithms to compute the elliptic curve scalar multiplication u...

Full description

Bibliographic Details
Main Authors:	Al Saffar, Najlae Falah Hameed, Md. Said, Mohamad Rushdan
Format:	Article
Published:	Foundation of Computer Science 2014

Similar Items

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

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

Improved arithmetic on elliptic curves over prime field
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)

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

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

On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems
by: Al-Saffar, Najlae F. Hameed, et al.
Published: (2013)

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

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

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)

Integer Sub-Decomposition (Isd) Method For Elliptic Curve Scalar Multiplication
by: Ajeena, Ruma Kareem K.
Published: (2015)

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

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

A hybrid addition chain method for faster scalar multiplication
by: Mohamed, Mohamad Afendee, et al.
Published: (2015)

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

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)

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)

A reduced τ-adic Naf (RTNAF) representation for an efficient scalar multiplication on Anomalous Binary Curves (ABC)
by: Yunos, Faridah, et al.
Published: (2014)

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)

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

On the design of projective binary Edwards elliptic curves over GF (p) benefitting from mapping elliptic curves computation to variable degree of parallel design
by: Al-Khatib, Mohammad Hussein Fayiz, et al.
Published: (2011)

Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.
by: Alkhatib, Mohammad, et al.
Published: (2013)

Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.
by: Mohammad Alkhatib,, et al.
Published: (2012)

An even and odd situation for the multiplier of scalar multiplication with pseudo τ-adic non-adjacent form
by: Mohd Suberi, Syahirah, et al.
Published: (2015)

A lucas based cryptosystem analog to the ElGamal cryptosystem and elliptic curve cryptosystem
by: Wong, Tze Jin, et al.
Published: (2014)

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)

Elliptical curve cryptography
by: Toh, Zheng Yi.
Published: (2009)

An even and odd situation for the multiplier of scalar multiplication with pseudo τ-adic non-adjacent form
by: Mohd Suberi, Syahirah, et al.
Published: (2016)

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

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

A survey on elliptic curve cryptography
by: Mohamed, Mohamad Afendee
Published: (2014)

A modular design of elliptic-curve point multiplication for resource constrained devices
by: Wei, Wei, et al.
Published: (2015)

A new addition formula for elliptic curves over GF(2/sup n/)
by: Al-Daoud, E., et al.
Published: (2002)

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

Demonstration of elliptic curve cryptography calculations
by: Kan, Yao
Published: (2018)

Weak implementations of elliptic curve cryptography
by: Koo, Yu Fang
Published: (2024)