On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems

QR Code

On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems

The group of the elliptic curve points forms an abelian group, which is considered as a suitable choice for constructing a problem similar to the Discrete Logarithm Problem. This creates and opens a new door for treatments of the special group and new operations. In 2005, Al-Saffar (2005) proposed...

Full description

Bibliographic Details
Main Authors:	Al-Saffar, Najlae F. Hameed, Md. Said, Mohamad Rushdan
Format:	Article
Language:	English
Published:	Malaysian Society for Cryptology Research 2013
Online Access:	http://psasir.upm.edu.my/id/eprint/30393/ http://psasir.upm.edu.my/id/eprint/30393/1/On%20the%20mathematical%20complexity%20and%20the%20time%20implementation%20of%20proposed%20variants%20of%20elliptic%20curves%20cryptosystems.pdf

Similar Items

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

Improved arithmetic on elliptic curves over prime field
by: Al Saffar, Najlae Falah Hameed, et al.
Published: (2014)

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

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)

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

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

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

Design and performance evaluation of parallel elliptic curve cryptosystem with GF(P) projective coordinates
by: Hussein Fayiz, Mohammad Al-Khatib
Published: (2012)

Securing the image through the combination of elliptic curve cryptosystem and hill cipher encryption
by: Sulaiman, Saniah
Published: (2019)

Garbage-man-in-the-middle (type 2) attack on the Lucas based El-Gamal cryptosystem in the elliptic curve group over finite field
by: Sarbini, Izzatul Nabila, et al.
Published: (2018)

On the wiener's attack into lucas based El-gamal cryptosystem in the elliptic curve over finite field
by: Wong, Tze Jin, et al.
Published: (2018)

An analysis for chosen plaintext attack in elliptic curve cryptosystem based on second order lucas sequence
by: Koo, Lee Feng, et al.
Published: (2019)

Security analysis of Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field using two types of GMITM attacks
by: Sarbini, Izzatul Nabila, et al.
Published: (2018)

{0, 1, 3}-NAF representation and algorithms for lightweight elliptic curve cryptosystem in Lopez Dahab model
by: Md. Yasin, Sharifah, et al.
Published: (2014)

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

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)

Lucas based el-gamal cryptosystem in the elliptic curve group over finite field under lenstras attack
by: Tze, Jin Wong, et al.
Published: (2018)

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

Common modulus attack against Lucas based El-Gamal Cryptosystem in the elliptic curve group over finite field
by: Koo, Lee Feng, et al.
Published: (2018)

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)

On the variants of RSA cryptosystem and its related algebraic cryptanalysis
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2019)

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

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

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

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

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

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

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

An improved public key cryptography based on the elliptic curve
by: Al-Daoud, Essam Faleh
Published: (2002)

A cubic analogue of the RSA cryptosystem
by: Md Said, Mohamad Rushdan, et al.
Published: (2003)

On the hastad's attack to LUC4,6 cryptosystem and compared with other RSA-type cryptosystem
by: Wong, Tze Jin, et al.
Published: (2013)

Kolyvagin Derivatives of Modular Points on Elliptic Curves
by: Hatton, Richard
Published: (2020)

Committal deniable signatures over elliptic curves
by: Han, Song, et al.
Published: (2004)

The extensions on algebraic attack in AES cryptosystem
by: RezaeiPour, Davood, et al.
Published: (2009)

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

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

Comparative of Rivest-Shamir-Adleman cryptosystem and its four variants using running time and memory consumption analysis
by: Mandangan, Arif, et al.
Published: (2024)

Chaotic pseudorandom sequences and the security of cryptosystems
by: Hina, Aliyu Danladi, et al.
Published: (2015)