Modifikasi Tanda Tangan Digital Pada Skema Esign Berbasis Kurva Eliptik

Sa'aadah Sajjana Carita, Evie Sri Wahyuni

Abstract


Digital signature has an important role in the digital era, where more and more people are joining the paperless life. Many cryptographic researchers support digital development by creating cryptographic schemes that are safe to use, and one of them is digital signature. This paper proposes a digital signature scheme based on an elliptic curve defined over with , where  and   are private keys of prime number elements. This scheme utilizes the advantages of elliptic curve cryptography in terms of security by using points that satisfy the elliptic curve equation. Additionally, the shorter key size increases the speed, making this scheme faster in signature values generation and verification process.

This research was conducted to determine the differences between the modified ESIGN scheme based on elliptic curve and the original ESIGN scheme. The process of finding the point on the ring , with a large , resulted in a more complex key generation algorithm. However, the selection of two points in this key generation is precomputed. This means the actual signature value generation algorithm took significantly less time than the original. This is one of the advantages of the proposed scheme.


Keywords


digital signature; elliptic curve cryptography; ESIGN scheme

Full Text:

PDF

References


R. A. Kramer, "A Survey of ESIGN: State of the Art and Proof of Security," Oregon, 2017.

A. Khalique, K. Singh and S. Sood, "Implementation of Elliptic Curve Digital Signature Alhorithm," International Journal of Computer Applications, vol. II, 2010.

A. J. Menezes, V. Oorschot, C. Paul and S. A. Vanstone, Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997.

A. Menezes, M. Qu, D. Stinson and Y. Wang, "Evaluation of Security Level of Cryptography: ESIGN Signature Scheme," 2001.

G. Pardo, "An Introduction to Elliptic Curve Cryptography," Introduction to Elliptic Curve Cryptography with Maple, Berlin Heidelberg, Springer-Verlag, 2013, pp. 611-676.

P. R. Varberg, Calculus, ninth edition, 2009.

T. Okamoto, A. Fujioka and E. Fujisaki, "An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Zn," Advance in Cryptography-CRYPTO'92, pp. 54-65, 1993.

Ahlswede, "Elliptic Curve Cryptosystem," in Hiding Data-Selected Topics, Switzerland, Springer International Publishing, 2016.

T. Okamoto and A. Shiraishi, "A Fast Signature Scheme Based on Quadratic Inequalities," IEEE, 1985.

J. H. Silverman, The Arithmetic of Elliptic Curves. New York: Springer, 2009.

ISARA, “Isogeny-Based Cryptography Tutorial,” 2019. [Online]. Available: https://www.isara.com/resource-center/isogeny-based-cryptography-tutorial.html.

J. Hoffstein, J. Pipher and J. H. Silverman, Elliptic Curve and Cryptography, New York: Springer, 2014.

A. Blumenfeld, “Discrete Logarithms on Elliptic Curves,” J. Rose-Hulman Undergrad. Math. J., vol. 12, no. 1, pp. 30–57, 2011.

W. Stallings, Cryptography and Network Security: Priciples and Practice, Seventh Edition, New Jersey: Pearson Education, 2017.

R. Munir, Kompleksitas Algoritma, ITB, 2015.




DOI: http://dx.doi.org/10.30646/sinus.v20i2.625

Refbacks

  • There are currently no refbacks.


 


STMIK Sinar Nusantara

KH Samanhudi 84 - 86 Street, Laweyan Surakarta, Central Java, Indonesia
Postal Code: 57142, Phone & Fax: +62 271 716 500 

Email: ejurnal @ sinus.ac.id | https://p3m.sinus.ac.id/jurnal/e-jurnal_SINUS/

ISSN: 1693-1173 (print) | 2548-4028 (online)


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

View My Stats