Claim Missing Document
Check
Articles

Found 36 Documents
Search

PENDETEKSIAN CITRA DAUN TANAMAN MENGGUNAKAN METODE BOX COUNTING Juwitarty, Novita Anggraini; Purnomo, Kosala Dwidja; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 20 No 1 (2020): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v20i1.17221

Abstract

Different types of plants make identification difficult. Therefore, we need a system that can identify the similarity of the leaves based on a reference leaf. Extraction can be done by taking one part of the plant and the most easily obtained part is the leaf part. Natural objects such as leaves have irregular shapes and are difficult to measure, but this can be overcome by using fractal dimensions. In this research, image detection of plant leaves will be carried out using the box counting method. The box counting method is a method of calculating fractal dimensions by dividing images into small boxes in various sizes. Image detection using fractal dimension values, we know which leaves the match with the reference. In this study,10 species of leave were tested, with each species 10 samples of plant leaves. Image testing of plant leaves uses a variety of r box size, namely 1/2 ,1/4 , 1/8 , 1/16 ,1/32 , 1/64 , 128which obtain an average match accuracy of 44%. Keywords: Box Counting, Fractal dimension
PENGAMANAN IMAGE DENGAN MODIFIKASI ALGORITMA ELECTRONIC CODE BOOK (ECB) Asti, Melinda; Kamsyakawuni, Ahmad; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 18 No 2 (2018): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v18i2.17252

Abstract

Cryptography is knowledge of encoding data to ensure the confidentiality, security, validity and integrity of data. Cryptography is divided into two namely classical cryptography and modern cryptography. One example of modern cryptography is the Electronic Code Book (ECB). Electronic Code Book (ECB) is a modern cryptographic method used to encrypt and decrypt text, images and more. The image is formed from several pixels which consist of several bits in a pixel. Bits are divided into two namely Least Significant Bit (LSB) and Most Significant Bit (MSB).LSB is the four rightmost bits while MSB is the leftmost four bits of a pixel. The purpose of this study is to compare the level of security of Electronic Code Book (ECB) image security results with the results of securing an Electronic Code Book (ECB) modified image. The data used in this study are 8 RGB and Greyscale images also a key in the form of one ASCII character. The results obtained show that securing images with modified Electronic Code Book (ECB) is safer than securing images with Electronic Code Book (ECB) based on histogram analysis, differential analysis and correlation coefficients. Keywords: ASCII, Electronic Code Book (ECB), Most Significant Bit (MSB)
A Menezes Vanstone Cryptosystem Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 15 No 2 (2015): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v15i2.23724

Abstract

Many kinds of cryptosystem models we have known. Generally if input of plaintext is alphabet so ciphertext is alphabet or real number that can be transform to alphabet. This paper will introduce a type of cryptosystem that have special output. It model is Menezes Vanstone cryptosystem. The plaintext of its method is pair of real number and ciphertext was produced is pair of real number too. If we want to know the meaning of ciphertext have to transform from real number to alphabet.
KOMBINASI CAESAR CIPHER DAN REVERSE CIPHER BERDASARKAN CIPHER BLOCK CHAINING Najah, Maulidyah Lailatun; Santoso, Kiswara Agung
Majalah Ilmiah Matematika dan Statistika Vol 21 No 2 (2021): Majalah Ilmiah Matematika dan Statistika
Publisher : Jurusan Matematika FMIPA Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/mims.v21i2.26978

Abstract

Communication in the current era of globalization is very developed. Many applications that can be used to facilitate communication. However, because of this convenience, the security of the information contained in it will be more easily hacked by irresponsible people. Cryptography is the science or art for security message. In cryptography there are two important processes, namely encryption and decryption. The sender's job is to encrypt the message and the receiver's job is to decrypt the message. The key used for this cryptographic process is the Cipher Block Chaining (CBC) operation mode. CBC mode is a very simple operation mode, so additional techniques are needed to make it more secure. The plaintext will be replaced with new plaintext resulting from a combination of Caesar Cipher and Reverse Cipher techniques. The results obtained indicate that the application of plaintext modifications to CBC can improve message security because the keys used are increasingly complex.
Digital Image Encryption by Using a Modified Hill Code Sochif Prasetiya; Mohammad Hasan; Kiswara Agung Santoso
Jurnal ILMU DASAR Vol 15 No 2 (2014)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (399.02 KB) | DOI: 10.19184/jid.v15i2.524

Abstract

Data security is very important data needed to stay awake in strict confidence from hacker intrusion or criminals who want to steal the data. Data security methods that are used in this paper is a digital image encryption by using a modified Hill’s code which is done by changing the way of encryption. If we are using Hill’s code then matrix pixel multiplied is the key matrix while on the modification Hill’s code before the key matrix then the matrix is multiplied pixels must be added to the results of the main diagonal elements of the matrix times key. The results obtained in the process of digital image encoding indicating that the image is encoded with password modification results of modified Hill's code more mixed reviews when compared to the image that was encoded with password Hill so that more effective in securing data in the form of a digital image. The size of the image file using the encoding results in a modification password Hill is smaller than ordinary password Hill with a percentage decrease of 4.6 % so more ease in delivery through electronic media Keyword: Digital image, modified Hill code, encryption, description  
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph Djoni Budi Sumarno; D Dafik; Kiswara Agung Santoso
Jurnal ILMU DASAR Vol 15 No 2 (2014)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (127.85 KB) | DOI: 10.19184/jid.v15i2.1051

Abstract

Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)∪E(G)→{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v ∈ V (G), uv ∈ E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge antimagic total properties of connected of Ferris Wheel F Wm,n by using deductive axiomatic method. The results of this research are a lemma or theorem. The new theorems show that a connected ferris wheel graphs admit a super (a, d)-edge antimagic total labeling for d = 0, 1, 2. It can be concluded that the result of this research has covered all feasible d. Key Words : (a, d)-edge antimagic vertex labeling, super (a, d)-edge antimagic total labeling, Ferris Wheel graph FWm,n.  
Penyembunyian Pesan Terenkripsi pada Citra menggunakan Algoritma LSB dan Transposisi Kolom Kiswara Agung Santoso; Ahmad Tanto Wiraga; Abduh Riski
Journal of Applied Informatics and Computing Vol 6 No 1 (2022): July 2022
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v6i1.3819

Abstract

Data security is a very important thing to do so that messages or information are sent to someone who is not known by unauthorized persons. Data security techniques that The ones that are often used today are cryptography and steganography. In this study, the data is to be secured in text. To increase security, text messages are first encrypted using the vigenere algorithm and column transposition. This text message is then hidden into an image (cover image). The encrypted text message was hidden in the image using the LSB algorithm and column transposition. The results of the study show that the virtual stego image generated is very effective similar to the original image. Based on the results of the MSE and PSNR analysis, it can be seen that the resulting image quality can be categorized as good. This can be seen from the PSNR value above 50 dB and some even above 60 dB. Based on the results of the LSB analysis, the stego image does not look strange so it will not be suspected by unauthorized people that there is a hidden message in the image.
Application of Genetic Algorithm on Inclusive Labeling of a Graph Kiswara Agung Santoso; Bagus Arief Setiawan; Kusbudiono Kusbudiono
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 4, No 1 (2022)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v4i1.24327

Abstract

As science developed, heuristic methods began to be used in graph coloring. Heuristic methods that have been used for graph coloring include Genetic Algorithm, Tabu Search, and Ant Colony Algorithm. A Genetic Algorithm is a method for solving optimization problems. In this study, the Genetic Algorithm will be used for the issue of labeling irregular vertices of inclusive distances to label any graph inclusively. We restrict an inclusive 1-distance to a simple graph using one-point crossover and mutation. The steps are a generation of random chromosomes, evaluating chromosome fitness values with tournament selection, conducting an evolutionary process consisting of one-point crossover and mutation, repeating the process until the termination criteria are met. The results of implementing the genetic algorithm on inclusive labeling can be determined by the chromatic number based on the adjacency matrix. The results of this labeling can be used as an alternative solution to the problem of inclusive labeling.Keywords: Genetic Algorithm; graph labeling; inclusive labeling. AbstrakSeiring berkembangnya ilmu pengetahuan metode heuristic mulai digunakan dalam pewarnaan graf. Metode heuristic yang telah digunakan untuk pewarnaan graf antara lain Algoritma Genetika, Tabu Search, dan Algoritma Semut (Ant Colony). Algoritma Genetika merupakan metode untuk menyelesaikan masalah optimasi. Pada penelitian ini, Algoritma Genetika digunakan untuk masalah pelabelan titik tak-teratur jarak inclusive agar dapat melabeli sebarang graf secara inclusive. Kami membatasi lingkup penelitian dengan menerapkan jarak inclusive 1 pada graf sederhana, menggunakan crossover satu titik dan mutasi. Metode yang digunakan dalam penelitian ini adalah studi literatur dengan mengkaji penggunaan Algoritma Genetika pada pelabelan titik tak-teratur jarak inclusive suatu graf. Langkah-langkah yang dilakukan adalah: pembangkitan kromosom secara acak, evaluasi nilai fitness kromosom dengan tournament selection, melakukan proses evolusi yang terdiri dari crossover satu titik dan mutasi, perulangan proses sampai kriteria pemerhentian terpenuhi. Hasil implementasi algoritma genetika pada pelabelan inclusive adalah dapat mengetahui bilangan kromatik berdasarkan matriks adjacency. Hasil pelabelan ini dapat dijadikan sebagai salah satu alternatif penyelesaian masalah pelabelan inklusif.Kata Kunci : Algoritma Genetika; pelabelan graf; pelabelan inklusif.
OTENTIKASI IMAGE BERBASIS MAGIC SQUARE ORDE n Kiswara Agung Santoso
UNEJ e-Proceeding 2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Image is a digital media that is easy to change, so it is susceptible to being used for crime. Image changes may be affected by the unstable internet during transmission or deliberate manipulation of images for specific purposes. Hence, we need a tool to determine the authenticity of the image. One strategy that can be used is to insert code into the entire image, so that any changes to the image information can be detected. The insertion process performed by dividing the image into several blocks, where the size of each block is adjusted according to the size of the magic square order 3. For the authentication process, the image that has been manipulated will be counted for each pixel. The results show that the manipulated image can be detected. The parts of the image that have changed can be identified because the pixel value doesn’t satisfy the magic square rule. Keywords: Authentication, Image, Magic Square, Pixel
PENGKODEAN TEKS MENGGUNAKAN MODIFIKASI ALGORITMA ELECTRONIC CODE BOOK DAN MERKLE-HELLMAN KNAPSACK Innafajri Insyirah; Kiswara Agung Santoso; Ahmad Kamsyakawuni
UNEJ e-Proceeding 2022: E-Prosiding Seminar Nasional Matematika, Geometri, Statistika, dan Komputasi (SeNa-MaGeStiK)
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Data security needs to be maintained so that the messages sent to someone are not known by an unauthorized users. One of the data security techniques that can be applied is cryptography. Cryptography is a science and art to keep messages secure when messages are sent from one place to another. In this study, modification of Electronic Code Book and Merkle-Hellman Knapsack algorithms will be applied to secure messages. This research uses Matlab to create a program. The weaknesses of ECB and Merkle-Hellman Knapsack algorithms will be overcome by modifying key and XOR operations. The result of ciphertext is a random numbers which are difficult to understand by unauthorized users. In addition, the message pattern on the same plaintext no longer produces the same ciphertext. Ciphertext can be decrypted well even though the size is two times or longer than plaintext. This is proved by plaintext from the results of decryption is same as the original plaintext. Keywords: Cryptography, Electronic Code Book, Merkle-Hellman Knapsack.