Melola Discovery

← Melola Discovery

Journal

Kombinasi Algoritma Sandi Caesar dan Algoritma RSA untuk Pengamanan Pesan Teks

Mathematical Sciences and Applications Journal · Vol. 5 No. 1 (2024) · pp. 14–20

DOI
10.22437/msa.v5i1.38104
ISSN
2988-6481
Published
2024-12-31
Publisher
Department of Mathematics, Faculty of Science and Technology Universitas Jambi
Language
en

Abstract

This article combines a simple cryptographic algorithm, Caesar Cipher, with a more complex algorithm, RSA, in order to increase the security of encrypted text messages. Text messages are first encrypted with the Caesar Cipher algorithm, which is then re-encrypted using the RSA algorithm. By utilizing number theory, specifically about integers and modulo arithmetic in the RSA algorithm, a public key and a secret key are obtained that will increase the security of the encryption process in this article. Due to the increased security of the text message, uninvolved parties cannot read the actual text message.

Keywords

Collaboration network of the authors

29 authors · 51 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Hasanuddin University
  • Bandung Institute of Technology
  • Universitas Trisakti
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Agusalim MasuliliAffiliation unknown3
Ade Ripki SetiawanAffiliation unknown3
Ida Ayu SuciAffiliation unknown2
Muhammad Zaky ZacharyAffiliation unknown2
Laily Wadil MuqadasAffiliation unknown2
Sukono SukonoAffiliation unknown2
Muhammad Arief BudimanAffiliation unknown2
Aurillya QueencyAffiliation unknown1
Putri Nisa PratiwiAffiliation unknown1
Tegar RidwansyahAffiliation unknown1
Betty SubartiniAffiliation unknown1
Hanifah Al AffianiAffiliation unknown1
Muhammad Deni JohansyahAffiliation unknown1
Nabila Nurmala HasanAffiliation unknown1
Azka Aufa KhoiriAffiliation unknown1
Mona ZevikaAffiliation unknown1
Nuning NurainiAffiliation unknown1
Glenn Lahodny Jr.Affiliation unknown1
Asep K. SupriatnaAffiliation unknown1
Muhammad Haekal DzulfikarAffiliation unknown1
Rini SuryaniAffiliation unknown1
SutikariniAffiliation unknown1
Sri RahayuHasanuddin University1
Pudji AstutiUniversitas Trisakti1
Hanni GarminiaBandung Institute of Technology1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://online-journal.unja.ac.id/index.php/msa/oai, first harvested 6 Nov 2026, last seen 8 Nov 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Kombinasi Algoritma Sandi Caesar dan Algoritma RSA untuk Pengamanan Pesan Teks</dc:title>
	<dc:creator xml:lang="en">Alamsyah, Alifa Raida</dc:creator>
	<dc:creator xml:lang="en">Kurniadi, Edi</dc:creator>
	<dc:creator xml:lang="en">Triska, Anita</dc:creator>
	<dc:creator xml:lang="en">Sylviani, Sisilia</dc:creator>
	<dc:subject xml:lang="en">Number theory</dc:subject>
	<dc:subject xml:lang="en">Cryptography</dc:subject>
	<dc:subject xml:lang="en">Caesar cipher</dc:subject>
	<dc:subject xml:lang="en">RSA algorithm</dc:subject>
	<dc:description xml:lang="en">This article combines a simple cryptographic algorithm, Caesar Cipher, with a more complex algorithm, RSA, in order to increase the security of encrypted text messages. Text messages are first encrypted with the Caesar Cipher algorithm, which is then re-encrypted using the RSA algorithm. By utilizing number theory, specifically about integers and modulo arithmetic in the RSA algorithm, a public key and a secret key are obtained that will increase the security of the encryption process in this article. Due to the increased security of the text message, uninvolved parties cannot read the actual text message.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Faculty of Science and Technology Universitas Jambi</dc:publisher>
	<dc:date>2024-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://online-journal.unja.ac.id/msa/article/view/38104</dc:identifier>
	<dc:identifier>10.22437/msa.v5i1.38104</dc:identifier>
	<dc:source xml:lang="en">Mathematical Sciences and Applications Journal; Vol. 5 No. 1 (2024): Mathematical Sciences and Applications Journal; 14-20</dc:source>
	<dc:source>2988-6481</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://online-journal.unja.ac.id/msa/article/view/38104/19853</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2024 Mathematical Sciences and Applications Journal</dc:rights>
</oai_dc:dc>