Garuda - Garba Rujukan Digital

p-Index From 2019 - 2024

2.647

P-Index

This Author published in this journals

All Journal Jurnal Edukasi dan Penelitian Informatika (JEPIN) Journal of Information Systems Engineering and Business Intelligence Sinkron : Jurnal dan Penelitian Teknik Informatika JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING IJISTECH (International Journal Of Information System & Technology) KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Jurnal Informatika Kaputama (JIK) Jurnal Mantik Jusikom: Jurnal Sistem Informasi Ilmu Komputer JATI (Jurnal Mahasiswa Teknik Informatika) REMIK : Riset dan E-Jurnal Manajemen Informatika Komputer Journal of Computer Networks, Architecture and High Performance Computing IJISTECH Dedikasi Sains dan Teknologi (DST) Brilliance: Research of Artificial Intelligence Prioritas : Jurnal Pengabdian Kepada Masyarakat Jurnal Ilmiah Teknik Informatika & Elektro (JITEK)

Nurul Khairina

Universitas Medan Area

Author-ID : 579823

Religion Aerospace Engineering Agriculture, Biological Sciences & Forestry Arts Humanities Astronomy Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Public Health Social Sciences Transportation Veterinary Other

Published : 22 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3

IMPLEMENTASI ALGORITMA KRIPTOGRAFI ONE TIME PAD (OTP) DENGAN DYNAMIC KEY LINEAR CONGRUENTIAL GENERATOR (LCG) Clawdia, Jhessica; Khairina, Nurul; Harahap, Muhammad Khoiruddin
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 1, No 1 (2017): Intelligence of Cognitive Think and Ability in Virtual Reality
Publisher : STMIK Budi Darma

Algorithms have an important role in the era of digitalization, by understanding the concept of algorithms can keep information security protected from third parties. Securing a password can increase the security of the data so that the sender can be more comfortable when sending messages to others. This paper aims to make Keys on OTP dynamically generated using random number generator Linear Congruential Generator (LCG) Method. This discussion provides the benefit of an extension of insight that key modifications to OTP can be made and can be dynamically created. Based on the research done, with the random number generator method Linear congruential generator then the key becomes Unique. So there is no repetition of the same key. This depends on the range of random numbers.

Analysis K-Nearest Neighbor Algorithm for Improving Prediction Student Graduation Time Muliono, Rizki; Lubis, Juanda Hakim; Khairina, Nurul
Sinkron : Jurnal dan Penelitian Teknik Informatika Vol 4 No 2 (2020): SinkrOn Volume 4 Number 2, April 2020
Publisher : Politeknik Ganesha Medan

Higher education plays a major role in improving the quality of education in Indonesia. The BAN-PT institution established by the government has a standard of higher education accreditation and study program accreditation. With the 4.0-based accreditation instrument, it encourages university leaders to improve the quality and quality of their education. One indicator that determines the accreditation of study programs is the timely graduation of students. This study uses the K-Nearest Neighbor algorithm to predict student graduation times. Students' GPA at the time of the seventh semester will be used as training data, and data of students who graduate are used as sample data. K-Nearest Neighbor works in accordance with the given sample data. The results of prediction testing on 60 data for students of 2015-2016, obtained the highest level of accuracy of 98.5% can be achieved when k = 3. Prediction results depend on the pattern of data entered, the more samples and training data used, the calculation of the K-Nearest Neighbor algorithm is also more accurate.

Menjaga Kerahasiaan Data dengan Steganografi Kombinasi LSB-2 dengan LSB-3 Dan Chess Board Pattern Khairina, Nurul; Harahap, Muhammad Khoiruddin
Sinkron : Jurnal dan Penelitian Teknik Informatika Vol 3 No 1 (2018): SinkrOn Volume 3 Nomor 1, Periode Oktober 2018
Publisher : Politeknik Ganesha Medan

Steganografi merupakan bidang keamanan dengan pola kerja yang menyisipkan data ke dalam beberapa media digital, proses penyisipan ini bertujuan untuk menyembunyikan keberadaan data tersebut dari pihak yang tidak bertanggung jawab. Penelitian ini, menjabarkan kombinasi algoritma Least Significant Bit yang sudah dimodifikasi yaitu Algoritma Least Significant Bit â€“ 2 dan algoritma Least Significant Bit â€“ 3. Pemaparan yang dilakukan adalah dengan mengkombinasikan kedua metode tersebut yang kemudian disisipkan ke dalam citra, dalam hal ini menggunakan format JPG, bit pesan akan disisipkan ke dalam salah satu piksel warna Red, Green dan Blue. Pola penyisipan yang dilakukan dengan Chess Board Pattern. Tingkat kerusakan citra diukur dengan metode Mean Square Error untuk melihat tingkat kerusakan citra apakah citra tersebut rusak atau tidak dengan batas ambang tertentu. Hasil penelitian ini memperoleh nilai MSE sebesar 1,2 %, dimana tidak terlihat adanya perubahan nilai warna yang signifikan dari citra hasil penyisipan terhadap citra asli.

Pencarian Jalur Terpendek dengan Algoritma Dijkstra Harahap, Muhammad Khoiruddin; Khairina, Nurul
Sinkron : Jurnal dan Penelitian Teknik Informatika Vol 2 No 2 (2017): SinkrOn Volume 2 Nomor 2 Oktober 2017
Publisher : Politeknik Ganesha Medan

Abstrak â€” Persoalan dalam menemukan jalur terpendek seiring dengan penghematan waktu yang tersingkat. Hal ini menjadi penting dalam kedinamisan masyarakat perkotaan. Jumlah rute yang ditempuh juga menjadi persoalan tersendiri untuk mencapai tempat tujuannya. Kita akan menentukan titik-titik manakah yang harus dilalui sehingga mendapatkan tempat tujuan dengan jarak terpendek dan penggunaan waktu yang tersingkat dengan menggunakan algoritma Dijkstra. Pencarian lintasan terpendek merupakan persoalan optimasi. Nilai pada sisi graph bisa dinyatakan sebagai jarak antar kota. Lintasan terpendek bisa diartikan sebagai proses minimalisasi bobot pada lintasan. Untuk mengatasi permasalahan itu maka diperlukan adanya suatu simulasi yang dapat membantu menentukan jalur terpendek. Algoritma Dijkstra bisa juga dikatakan sebagai algoritma Greedy yang pada pembahasan ini mampu memudahkan kita mencari jalur rute terpendek dan menjadi lebih efekfif. Kata Kunci â€” Dijkstra, Greedy, Jalur terpendek, Optimasi waktu.

The Comparison of Methods for Generating Prime Numbers between The Sieve of Eratosthenes, Atkins, and Sundaram Harahap, Muhammad Khoiruddin; Khairina, Nurul
Sinkron : Jurnal dan Penelitian Teknik Informatika Vol 3 No 2 (2019): SinkrOn Volume 3 Number 2, April 2019
Publisher : Politeknik Ganesha Medan

Prime numbers are unique numbers. Prime numbers are numbers that only have a dividing factor consisting of numbers 1 and the number itself. The prime numbers from 1 to n that are relatively small can be generated manually, but a prime number generator algorithm is needed to generate prime numbers on a large scale. This study compares three prime number generator algorithms, namely: The Sieve of Eratosthenes, The Sieve of Atkins, and The Sieve of Sundaram. These three sieve algorithms have their own differences in generating prime numbers. The Sieve of Eratosthenes uses a simpler method by crossing multiples of prime numbers and marking them as non-prime numbers. The Sieve of Atkins uses several requirements for quadratic equations and modulus in determining prime numbers. The Sieve of Sundaram has an algorithm similar to The Sieve of Atkins, but there are requirements for linear equations to determine prime numbers. This study aims to see a comparison of these three algorithms in terms of accuracy and speed in generating prime numbers on a large scale. The results of this study indicate The Sieve of Eratosthenes, Atkins and Sundaram algorithms can generate large numbers of prime numbers with good accuracy, this was tested by the Fermat Primality Test Algorithm. The conclusion that can be drawn from this study, The Sieve of Eratosthenes have a faster time to generate prime numbers on a large scale than the other two algorithms.

Sistem Informasi Administrasi Surat Masuk Dan Surat Keluar Pada Dinas Pendidikan Kota Medan Faisal, Ahmad; Khairina, Nurul
REMIK: Riset dan E-Jurnal Manajemen Informatika Komputer Vol. 4 No. 2 (2020): Remik Volume 4 Nomor 2 April 2020
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/remik.v4i2.10557

Perkembangan saat ini sangatlah meningkat dibidang teknologi sehingga mengharuskan suatu organisasi ataupun instansi pemerintahan untuk menggunakan suatu sistem yang terkomputerisasi. Dinas Pendidikan Kota Medan, merupakan salah satu instansi pemerintahan, Dinas Pendidikan Kota Medan menangani ratusan surat setiap harinya dari sekolah-sekolah yang aktif di kota medan. Pada sekretariat badan pengurus surat di Dinas Pendidikan Kota Medan masih dilakukan secara pembukuan. Metodologi Penelitian melalui metode pengambilan data dan metode perancangan untuk membuat dan mendesain sistem informasi yang tepat guna dan efektif dengan yang diinginkan. Hasil yang dicapai adalah Sistem Informasi Administrasi Surat Masuk dan Surat Keluar Pada Dinas Pendidikan Kota Medan untuk mempermudah dan meningkat kinerja pegawai yang mengurus manajemen surat. Kesimpulannya Sistem Informasi Administrasi Surat Masuk dan Surat Keluar sangatlah penting untuk meningkatkan kinerja dan mempermudah pencarian informasi surat.

Steganography Citra dengan Metode Least Significant Bit Random Placement Harahap, Muhammad Khoiruddin; Khairina, Nurul
JEPIN (Jurnal Edukasi dan Penelitian Informatika) Vol 6, No 2 (2020): Volume 6 No 2
Publisher : Program Studi Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26418/jp.v6i2.40620

Steganografi memiliki keunikan tersendiri dalam menyembunyikan keberadaan sebuah pesan rahasia. Steganografi identik dengan penggunaan media tertentu dalam menjaga kerahasiaan pesan, tetap menjadi favorit para peneliti untuk tetap mengembangkan penelitian di bidang ilmu ini. Metode Least Significant Bit merupakan metode steganografi sederhana, serta memiliki perubahan relatif kecil dan tidak dapat dlihat secara visual manusia. Metode Linear Congruential Generator merupakan metode pembangkit bilangan acak. Metode ini digunakan untuk memilih koordinat piksel P(x,y) secara acak, kemudian piksel acak yang terpilih akan digunakan sebagai acuan dasar dalam penyisipan pesan. Penelitian ini mengkombinasikan metode Least Significant Bit dengan Linear Congruential Generator yang disertai dengan penggunaan operator Boolean XOR yang berfungsi untuk memproses pesan biner dengan piksel citra. Hasil operasi XOR berupa bilangan biner yang akan di replace pada citra asli dan kemudian akan menghasilkan stego image. Dari proses penelitian serta pengujian embedded dan extraction, dapat diambil kesimpulan bahwa penelitian ini menghasilkan keterbaharuan sederhana dan unik. Hasil penelitian menunjukkan bahwa sebuah piksel dapat disisipkan pesan lebih dari satu kali. Penyisipan juga dapat dilakukan pada beberapa piksel acak maupun pada delapan piksel tetangga yang berhubungan dengan piksel acak P(x,y). Di samping itu perubahan stego image terhadap gambar original juga terlihat sangat minim dan tidak dapat dilihat secara kasat mata. Kombinasi beberapa metode pada penelitian ini juga tetap mampu menjaga kualitas citra yang dibuktikan dengan nilai MSE yang mencapai 0.04 pada penyisipan 100 karakter dengan resolusi gambar 1024 x 1024 sehingga tidak menimbulkan kecurigaan pihak lain terhadap adanya penyembunyian pesan rahasia pada sebuah citra.

The Authenticity of Image using Hash MD5 and Steganography Least Significant Bit Nurul Khairina; Muhammad Khoiruddin Harahap; Juanda Hakim Lubis
IJISTECH (International Journal of Information System and Technology) Vol 2, No 1 (2018): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v2i1.13

A creation can be considered as belonging to someone if they have a valid proof. An original creation that have been changed for certain purposes will definitely eliminate proof of ownership of the creation. A hash function is one method used to test the authenticity of data, while steganography is one method used to maintain the security of confidential data from outside parties. In this study, the Hash MD5 method will be combined with the Least Significant Bit method to test the authenticity of an image. The purpose of testing the authenticity is to find out the truth of ownership of a creation, in this case, we are testing the image. The results of this test are the status of an image that will be declared valid or invalid. Measurement of validity depends on whether there is a similarity between the value of the Hash that has been implanted and the value of the Hash obtained during the test. If the tested image has the same Hash value, then the image will be declared valid, but instead ai image is declared invalid if the image has been modified or ownership status has been changed. From the result of testing the authenticity with several images, it can prove that the combination of the Hash MD5 method with LSB has a good level of security and suitable to authenticity testing.

PERANCANGAN DAN IMPLEMENTASI APLIKASI SISTEM INFORMASI DOKUMENTASI DAN PELAPORAN DOKUMEN BORANG AKREDITASI PROGRAM STUDI PADA UNIVERSITAS MEDAN AREA PROGRAM PKM DIYA 2019 Juanda Hakim Lubis; Rizki Muliono; Nurul Khairina
Jurnal Informatika Kaputama (JIK) Vol 4, No 1 (2020): VOLUME 4 NOMOR 1, EDISI JANUARI 2020
Publisher : STMIK KAPUTAMA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.1234/jik.v4i1.230

Medan Area University (UMA) is one of the oldest private universities in northern Sumatra, which was founded by Haji Agus Salim Siregar in 1983. Especially at Medan Area University the document collection processing model for LKPS-APS is currently still not organized with neat and there is still a loss of LKPS-APS documents, especially when the deadline for LKPS-APS preparation is nearing the upload period. To improve performance in document processing, a system will be built to facilitate lecturers and staff in managing LKPS-APS documents properly and in detail, and reduce the reason lecturers or staff cannot attend meetings in the processing and collection of LKPS-APS document forms that can be submitted into the online system and online discussion per document in the LKPS-APS information system according to 9 standard criteria according to the Instrument Akreditasi Program Studi 4.0 (IAPS 4.0) for Study Program Accreditation.

Identification of Pneumonia using The K-Nearest Neighbors Method using HOG Fitur Feature Extraction Nurul Khairina; Theofil Tri Saputra Sibarani; Rizki Muliono; Zulfikar Sembiring; Muhathir Muhathir
JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Vol 5, No 2 (2022): Issues January 2022
Publisher : Universitas Medan Area

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31289/jite.v5i2.6216

Pneumonia is a wet lung disease. Pneumonia is generally caused by viruses, bacteria or fungi. Not infrequently Pneumonia can cause death. The K-Nearest Neighbors method is a classification method that uses the majority value from the closest k value category. At this time people are not too worried about pneumonia because this pneumonia has symptoms like a normal cough. However, fast and accurate information from health experts is also very necessary so that pneumonia symptoms can be recognized early and how to deal with them can also be done faster. In this study, researchers will diagnose pneumonia to obtain information quickly about the symptoms of pneumonia. This information will adopt human knowledge into computers designed to solve the problem of identifying pneumonia. In this study, the K-Nearest Neighbors method will be combined with the HOG Extraction Feature to identify pneumonia more accurately. The KNN classification used is Fine KNN, Cosine KNN, and Cubic KNN. Where will be seen how the value of accuracy, precision, recall, and fi-score. The results showed that the classification could run well on the Fine KKN, Cosine KNN, and Cubic KNN methods. Fine KNN has an accuracy rate of 80.67, Cosine KNN has an accuracy rate of 84,93333, and Cubic KNN has an accuracy rate of 83,13333. Fine KNN has precision, recall and f1-score values of 0.794842, 0.923706, and 0.854442. Cosine KNN has precision, recall and f1-score values of 0.803048, 0.954039, and 0.872056. Cubic KNN has precision, recall and f1-score values of 0.73388, 0.964561, and 0.833555. From the test results, positive and negative identification of pneumonia was found to be more accurate with the Cosine KNN classification which reached 84,93333.

Co-Authors Adidtya Perdana, Adidtya Ahmad Faisal Andre Hasudungan Lubis Clawdia, Jhessica Dian Noviandri Fordinand Halomoan Pasaribu Juanda Hakim Lubis Juanda Hakim Lubis Juanda Hakim Lubis Mhd. Zulfansyuri Siambaton Muhammad Fikri Riandra Muhammad Khoiruddin Harahap Muhathir Muhathir - Muhathir Muhathir Napisah Napisah Rizki Muliono Rizki Muliono Rizki Muliono, Rizki Robin Robin Saut Dohot Siregar Sri Wahyuni Susilawati Susilawati Syah, Rahmad Theofil Tri Saputra Sibarani zulfikar sembiring

Title

Found 22 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 22 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 22 Documents
Search