Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Integra: Journal of Integrated Mathematics and Computer Science

Key Matrix Generation Using Random Functions in Hill Cipher Modulo 95 Cryptography Bahtiar, Nurdin; Widodo, Aris Puji; Puspita, Nikken Prima
Integra: Journal of Integrated Mathematics and Computer Science Vol. 2 No. 1 (2025): March
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20252111

Abstract

In symmetric cryptography, the confidentiality of the chosen key and the security of its delivery mechanism are paramount to minimize the risk of unauthorized disclosure. Typically, in such systems, the sender and recipient focus primarily on the message (plaintext and ciphertext) rather than the complexities associated with key management. This approach aims to alleviate the burden of selecting a suitable and robust key for communicating parties. This study introduces a Hill Cipher modulo 95 cryptography method employing a matrix-based key, where key generation is achieved through a quantifiable randomization algorithm. The developed 2x2 key matrix facilitates a substantial number of possible keys, specifically 954 (exceeding 81 million). The key matrix generation process incorporates several functions, including those for ASCII character conversion, prime number verification, relative primality checks, modulo arithmetic, inverse modulo computation, determinant calculation, and inverse matrix determination. To simulate the encryption and decryption process, a desktop application was developed using the Lazarus Development IDE version 3.6. The application demonstrates effective generation of the required key matrix.
The Cleanness Property of The Integers Modulo n (ℤn) 'Aliyah, Dheva Ufiz; Puspita, Nikken Prima; Tjahjana, Redemtus Heru
Integra: Journal of Integrated Mathematics and Computer Science Vol. 1 No. 2 (2024): July
Publisher : Magister Program of Mathematics, Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/integrajimcs.20241214

Abstract

Assume that R is a ring with identity. A ring R is said to be clean when each of its elements can be written as the sum of an idempotent and a unit element within the ring. A stronger condition, known as strongly clean, requires that these elements commute under multiplication. As a special case, a module M over ring R is called a clean module when the endomorphism ring of the M is a clean module over R. Moreover, when the ring endomorphism of R-module M is a strongly clean, then the module M is referred to as a strongly clean. We know that the integers modulo n, denoted by ℤn, is a ring by the set of congruence classes modulo n, with standard addition and multiplication operations. In this study, we explore the cleanness properties of the ring ℤn and establish that it is a strongly clean ring. Furthermore, we study about the cleanness of ℤn as a module over ℤ and investigate the strongly cleanness of it module.