cover
Contact Name
Khairul Alim
Contact Email
khairulalim@unja.ac.id
Phone
+628116646998
Journal Mail Official
msa_admin@unja.ac.id
Editorial Address
Department of Mathematics Faculty of Science and Technology Universitas Jambi Kampus Pinang Masak Mendalo Jambi Indonesia
Location
Kota jambi,
Jambi
INDONESIA
Mathematical Sciences and Applications Journal
Published by Universitas Jambi
ISSN : -     EISSN : 29886481     DOI : https://doi.org/10.22437/msa.v4i2
Core Subject : Science, Education,
The scope of this journal including is Real Analysis Algebra Applied mathematics Computational Mathematics Applied Statistics Actuarial mathematics and others
Articles 24 Documents
Aplikasi Algoritma Euclidean dalam Produksi Jagung di Pulau Jawa Setiawan, Ade Ripki; Kurniadi, Edi; Triska, Anita; Sylviani, Sisilia
Mathematical Sciences and Applications Journal Vol. 5 No. 1 (2024): Mathematical Sciences and Applications Journal
Publisher : Department of Mathematics, Faculty of Science and Technology Universitas Jambi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22437/msa.v5i1.38080

Abstract

Corn farming on the island of Java plays a crucial role in meeting the nation's food needs. However, variations in land conditions across provinces in Java result in differing production levels. This disparity affects the supply of corn in the market, and the selling price often does not align with farmers' expectations. Therefore, this article aims to determine the optimal timing for distributing corn, particularly on the island of Java, using the Euclidean algorithm. The Euclidean algorithm is used to calculate the greatest common divisor (gcd), which in turn is applied to determine the least common multiple (lcm). The lcm results can serve as a reference for identifying the best time to sell corn to prevent price declines. Additionally, a comparison of production levels across provinces is presented to help corn farmers understand when and where to distribute their produce to achieve maximum profit.
Metode Pemecahan Sistem Kongruensi Linear Budiman, Muhammad Arief; Kurniadi, Edi; Sukono, Sukono; Sylviani, Sisilia
Mathematical Sciences and Applications Journal Vol. 5 No. 1 (2024): Mathematical Sciences and Applications Journal
Publisher : Department of Mathematics, Faculty of Science and Technology Universitas Jambi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22437/msa.v5i1.38085

Abstract

A linear congruence system is a system that has more than one linear congruence. The solution of linear congruence systems has an important role in the concept of number theory. Various ways of settlement can be applied in different cases. This study discusses the problem solving of linear congruence systems with the Chinese Remainder Theorem, Intelligent Inspection Algorithm type-I and II and its application.
Aplikasi Teorema Fermat dalam Kriptografi Al Affiani, Hanifah; Johansyah, Muhammad Deni; Sylviani, Sisilia
Mathematical Sciences and Applications Journal Vol. 5 No. 1 (2024): Mathematical Sciences and Applications Journal
Publisher : Department of Mathematics, Faculty of Science and Technology Universitas Jambi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22437/msa.v5i1.38094

Abstract

Cryptography is the science and technique of disguising messages in a unique form so that they can only be read and processed by the intended recipient. Many studies have been conducted to develop algorithms that can be used to encode information in a way that is difficult to crack and cannot be recognized by adversaries. One example of the most popular algorithms is the Rivest-Shamir-Adleman (RSA), which uses different key pairs for the encryption and decryption process of messages, usually known as the public key and private key. In public key-based encryption systems such as RSA, Fermat's theorem plays an important role because it enables modular exponential calculations on key pairs to be performed efficiently and provides a security basis for the RSA algorithm. Thus, this research aims to describe the application of Fermat's theorem in the RSA algorithm, where the encryption and decryption process involves modular exponentiation with public and private keys. As a result, using the properties of modular exponentiation in Fermat's theorem, this system ensures information remains secure from attacks by third parties without access to the private key, even if they succeed in intercepting encrypted messages. It can be concluded that Fermat's theorem plays a crucial role in establishing a solid mathematical foundation for creating secure and efficient cryptographic systems.
Kombinasi Algoritma Sandi Caesar dan Algoritma RSA untuk Pengamanan Pesan Teks Alamsyah, Alifa Raida; Kurniadi, Edi; Triska, Anita; Sylviani, Sisilia
Mathematical Sciences and Applications Journal Vol. 5 No. 1 (2024): Mathematical Sciences and Applications Journal
Publisher : Department of Mathematics, Faculty of Science and Technology Universitas Jambi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22437/msa.v5i1.38104

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.

Page 3 of 3 | Total Record : 24