A hybrid addition chain method for faster scalar multiplication

QR Code

A hybrid addition chain method for faster scalar multiplication

Solutions to addition chain problem can be applied to operations involving huge number such as scalar multiplication in elliptic curve cryptography. Recently, a decomposition method was introduced, with an intention to generate addition chain with minimal possible terms. Totally different from other...

Full description

Bibliographic Details
Main Authors:	Mohamed, Mohamad Afendee, Md. Said, Mohamad Rushdan
Format:	Article
Language:	English
Published:	World Scientific and Engineering Academy and Society 2015
Online Access:	http://psasir.upm.edu.my/id/eprint/36171/ http://psasir.upm.edu.my/id/eprint/36171/1/A%20Hybrid%20Addition%20Chain%20Method%20For%20Faster%20Scalar%20Multiplication.pdf

Similar Items

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

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

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

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

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

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

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

Iterative sliding window method for shorter number of operations in modular exponentiation and scalar multiplication
by: Noma, Adamu Muhammad, et al.
Published: (2017)

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

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

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)

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)

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

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

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

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)

Shorter addition chain for smooth integers using decomposition method.
by: Mohamed, M. A., et al.
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)

A Faster External Sorting Algorithm Using No Additional Disk Space
by: Islam, Md. Rafiqul, et al.
Published: (2006)

Faster algorithms for computing maximal multirepeats in multiple sequences
by: Iliopoulos, Costas, et al.
Published: (2009)

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

Computation of cryptosystem based on Lucas functions using addition chain
by: Md Ali, Zulkarnain, 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)

UPM develops faster, better screening method
by: Roslam, Muhammad Basir
Published: (2021)

A review on heuristics for addition chain problem: towards efficient public key cryptosystems
by: Muhammad Noma, Adamu, et al.
Published: (2017)

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

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

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

Multi-base number representation in application to scalar multiplication and pairing computation
by: Mohammed Ismail, Abdelwahed
Published: (2011)

Faster 'Harvast' with UPM product
by: New Straits Times
Published: (2023)

Self-test for faster results
by: Tang, Ashley
Published: (2021)

China’s Weibo: is faster different?
by: Sullivan, Jonathan
Published: (2013)

Worker/wrapper/makes it/faster
by: Hackett, Jennifer, et al.
Published: (2014)

Addition chain heuristics in application to elliptic curve cryptosystems
by: Mohamed, Mohamad Afendee, et al.
Published: (2024)

Inoculating a household at a time will be faster
by: New Straits Times
Published: (2021)

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

A faster version of rijndael cryptographic algorithm using cyclic shift and bit wise operations
by: Mohd Ali, Fakariah Hani, et al.
Published: (2009)

Unimas to enjoy faster Internet connectivity
by: The Borneo Post
Published: (2007)

New cheaper, faster way to heal
by: Chin, Christina
Published: (2019)