Tanda tangan Digital Menggunakan Algoritme Keccak dan RSA

  • Rezania Agramanisti Azdy STMIK PalComTech
Keywords: tandatangan digital, Keccak, RSA, integritas, autentikasi, non-repudiation

Abstract

Just like conventional signatures, digital signatures can be used to prove the authenticity of a document in digital form. In addition, digital signatures can also be used to prove the validity of the author of the document, so that the author of the document can not deny that he had made the document. Digital signature is done by applying two cryptographic algorithms sequentially. The first algorithm is to impose hash function on a real document to produce message digest, and the second one is to impose a public key algorithm to the digest form. Keccak hash function is an algorithm that has been set as SHA-3 in a competition held by NIST and can be used to determine if a document has been modified or not. RSA is a public key algorithm which ensures the safety in the form of authentication and non-repudiation, so it is suitable with the actual purpose of digital signature. This paper implements the Keccak and RSA algorithm on digital signature as well as comparing it with the use of MD5. The test results of the implementation of both algorithms show that the establishment of digital signature on a whole process requires a relatively short time, and it is able to achieve the goals of digital signatures to guarantee the security in the aspects of integrity, authentication and non-repudiation.

References

Y. F. Lim, “Digital signatures, certification authorities: certainty in the allocation of liability”, Singapore Journal of International & Comparative Law, vol. 7, issue 1 , pp. 183-200, 2003.

C. Romine, “Digital Signature Standard (DSS)”, Federal Information Processing Standards Publication, Information Technology Laboratory National Institute of Standards and Technology, Jul. 2013.

Anyapu, S., Aparna, G., Manognya, R., Kumar, D.R., “Message Security Through Digital Signature Generation and Message Digest Algorithm”, International Journal of Emerging Technology and Advanced Engineering, vol. 3, no. 3, pp.300-304, Mar. 2013.

Stevens, M.M.J., “On Collisions for MD5”, Master’s Thesis, Dept. of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, Jun. 2007.

C. Bentivenga, F. Christie, and M. Kitson. (2010) Keccak Final Paper. [Online]. Available: https://www.cs.rit.edu/~ark/winter2012/482/team/u5/report.pdf

C. H. Romine. (Agt. 2015) SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. [Online]. Available: http://csrc.nist.gov/publications/drafts/fips-202/fips_202_draft.pdf

R.L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM, vol. 21, pp. 120-126, 1978

D. Boneh, “Twenty years of attacks on the RSA cryptosystem”, Notices of the American Mathematical Society (AMS), vol. 46, no. 2, pp. 203-213, 1999.

A. Nitaj. The Mathematical Cryptography of the RSA Cryptosystem. [Online]. Available: http://www.math.unicaen.fr/~nitaj/RSAnitaj1.pdf

A. I. Ali, “Comparison and evaluation of digital signature schemes employed in NDN network”, International Journal of Embedded systems and Applications(IJESA), vol. 5, no. 2, pp. 15-29, Jun. 2015

W. Diffie and M. E. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.

A.M. Jaafar, A. Samsudin, “Visual digital signature scheme: a new approach”, IAENG International Journal of Computer Sciences, vol. 37, no. 4, 2010.

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche. (Jan. 2011) Cryptographic sponge functions. [Online]. Available: http://sponge.noekeon.org/CSF-0.1.pdf

E. Milanov. (Jun. 2009) The RSA algorithm. [Online]. Available: https://www.math.washington.edu/~morrow/336_09/papers/Yevgeny.pdf.

How to Cite
Rezania Agramanisti Azdy. (1). Tanda tangan Digital Menggunakan Algoritme Keccak dan RSA. Jurnal Nasional Teknik Elektro Dan Teknologi Informasi, 5(3), 184-191. Retrieved from https://journal.ugm.ac.id/v3/JNTETI/article/view/2932
Section
Articles