scholarly journals Implementasi Enkripsi Data Secure Hash Algorithm (SHA-256) dan Message Digest Algorithm (MD5) pada Proses Pengamanan Kata Sandi Sistem Penjadwalan Karyawan

2018 ◽  
Vol 10 (2) ◽  
pp. 70-74
Author(s):  
Santi Sulastri ◽  
Riana Defi Mahadji Putri
Keyword(s):  
System Simulation ◽  
Brute Force ◽  
Avalanche Effect ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Message Digest ◽  
Simulation Results ◽  
Brute Force Attack ◽  
The Web

There are various types of encryption that can be used, for example MD5 and SHA-256. However, using  MD5 or SHA-256 alone is not safe enough because it can be solved by using a brute force attack. The method of working is very simple is to try all possible combinations. This study aims to develop MD5 and SHA256 collaboration methods. Encryption is applied to the user's password on the web login system. Simulation results can be tested by measuring resistance to brute force attacks and the value of the avalanche effect (AE). From the results of the tests carried out by using attack software, the results of the application are quite safe from brute force attacks. From the AE test obtained the result with an AE value of 71% which means that the encoding result is good enough.

scholarly journals Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

2019 ◽  
Vol 8 (10) ◽  
pp. 2010-2018
Keyword(s):  
Block Cipher ◽  
Data Encryption ◽  
The Novel ◽  
Brute Force ◽  
Avalanche Effect ◽  
Security Enhancement ◽  
Aes Algorithm ◽  
Dispersion Technique ◽  
Brute Force Attack ◽  
High Computational Complexity

Advance Encryption Standard (AES) supersedes Data Encryption Standard (DES) and is the best known and most widely used block cipher. As for now, there are no known practical attacks that would allow anyone to read correctly implemented AES encrypted data. However, several theoretical attacks have been announced until now. A theoretical attack called Biclique Attack is known to have broken Full AES and requires 2126.1 , 2 189.7 , 2254.4 operations to recover an AES-128, AES-192, AES-256 respectively. Biclique Attack is faster than Brute force attack by a factor of four. As such, these theoretical attacks are of high computational complexity; they do not threaten the practical use of AES in any way. However, attacks always get better; they never get worse. As the technology evolves, successful attacks (using Quantum Computing and faster GPU) against AES may turn up, and they may be difficult to ignore. In this study, we aim to enhance the security prospects of AES with the inclusion of Dynamicity character in AES S-Box for increased resilience against Brute Force Attack and Biclique Attack, and hashing technique is combined with AES algorithm to achieve variance in security using MD4, SHA3 or SHA5. The novel key dispersion technique is introduced to increase the avalanche effect of AES algorithm.

scholarly journals SMS Security Improvement using RSA in Complaints Application on Regional Head Election’s Fraud

2019 ◽  
Vol 7 (3) ◽  
pp. 116-120 ◽  
Author(s):  
Dwi Yuny Sylfania ◽  
Fransiskus Panca Juniawan ◽  
Laurentinus Laurentinus ◽  
Harrizki Arie Pradana
Keyword(s):  
Privacy Protection ◽  
Brute Force ◽  
Avalanche Effect ◽  
Rsa Algorithm ◽  
Election Fraud ◽  
Key Length ◽  
Brute Force Attack ◽  
Campaign Time

In the campaign period of regional heads election, fraud can occur, such as money politics, blaming campaign facilities, campaign time violations, and black campaign. This study implemented a secure SMS application for election fraud complaints as a tool for the society to report all forms of election fraud that have occurred to the election supervisory department safely. The RSA algorithm was applied to encrypt the messages for sender privacy protection. The application was able to perform the message randomization function properly with a 10.44% avalanche effect. Brute force attack using a 16-bit key length needs 3.7 milliseconds for each try to find 32.768 possible private keys.

scholarly journals Implementasi Keyed-Hash Message Authentatication Code Pada Sistem Keamanan Rumah

MIND Journal ◽  
2018 ◽  
Vol 1 (1) ◽  
pp. 9
Author(s):  
M Ichwan ◽  
Milda Gustian ◽  
Novan Rizky Nurjaman
Keyword(s):  
Hash Function ◽  
Message Authentication ◽  
Brute Force ◽  
Message Authentication Code ◽  
Authentication Code ◽  
Avalanche Effect ◽  
Brute Force Attack

Keyed-Hash Message Authentication Code (HMAC) adalah algoritma untuk menghitung nilai MAC (Message Authentication Code) yang menggunakan Fungsi Hash dikombinasikan dengan sebuah kunci rahasia, Fungsi Hash yang digunakan dalam penelitian ini adalah Secure Ha sh Algorithm 256 (SHA256). Nilai MAC digunakan sebagai otentikasi untuk menjamin integritas data dan keaslian pesan. Algoritma ini di implementasikan pada sistem keamanan rumah, dimana pertukaran pesan antara user dan sistem keamanan di otentikasi dengan menggunakan HMAC. Keamanan  algoritma  HMAC ini  dibuktikan  dengan  hasil  pengujian  Avalanche  effect  yang mencapai 87.5% pada fungsi Hash yang digunakan ,dan dibutuhkan waktu sampai 84 tahun untuk serangan Brute force berhasil pada kunci dengan panjang 8 karakter. Kata kunci: keyed-Hash Message Authentication Code, Hash function, Avalanche  effect, Brute force attack

scholarly journals Implementasi Secure Hash Algorithm-1 Untuk Pengamanan Data Dalam Library Pada Pemrograman Java

2015 ◽  
Vol 1 (1) ◽  
pp. 57 ◽  
Author(s):  
Komang Aryasa ◽  
Yeyasa Tommy Paulus
Keyword(s):  
Data Security ◽  
Value Of Information ◽  
String Length ◽  
Java Programming ◽  
Programming Library ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Message Digest ◽  
Original Message ◽  
Made In

Masalah Keamanan merupakan salah satu aspek penting dari sistem informasi. Begitu pentingnya nilai informasi menyebabkan seringkali informasi diinginkan oleh orang tertentu kemudian dapat memodifikasi informasi tersebut. Untuk dapat mengesahkan informasi yang didapatkan, maka harus dilakukan authentication pada informasi sehingga diketahui keaslian informasi. Dalam penelitian ini diimplementasikan suatu metode secure hash algorithm-1, sehingga penerima informasi dapat mengetahui adanya perubahan terhadap data penting yang diterima dari pihak lain. Metode ini mampu membangkitkan nilai hash dari sebuah string atau file. Dengan perubahan sekecil apapun pada informasi yang diterima, dapat diketahui keasliannya. Secure Hash Algorithm adalah fungsi hash yang bekerja satu arah, ini berarti pesan yang sudah diubah menjadi message digest tidak dapat dikembalikan menjadi pesan semula. Dua pesan yang berbeda akan selalu menghasilkan nilai hash yang berbeda pula. Hasil rancangan perangkat lunak ini dengan input panjang string yang berbeda akan menghasilkan output dengan panjang string tetap yaitu 160 bit, yang dapat dibuat dalam bentuk library pada pemrograman java sehingga dapat langsung digunakan untuk proses otentikasi dan keamanan data.Security problem is one of the important aspects of the information system. Once the importance of the value of information causes information is often desired by a particular person can then modify that information. To be able to certify that the information obtained, it must be done so that the authentication on the information known to the authenticity of the information. In this study implemented a method of secure hash algorithm-1, so that the recipient can know the information of changes to important data received from the other party. This method is able to generate a hash value from a string or file. With the slightest change to the information received, it is known authenticity. Secure Hash Algorithm is a hash function that works in one direction, this means that the message has been converted into a message digest can not be restored to its original message. Two different messages will always produce a different hash value. Software design results with different input string length would produce output with fixed string length is 160 bits, which can be made in the form of the Java programming library that can be directly used for authentication and data security.

scholarly journals Penetration Testing: Wireless Network Attacks Method on Kali Linux OS

2021 ◽  
Vol 10 (1) ◽  
pp. 7
Author(s):  
Renas R. Asaad
Keyword(s):  
Wireless Networks ◽  
Wireless Network ◽  
Internet Access ◽  
Brute Force ◽  
Dictionary Attack ◽  
Network Attacks ◽  
Penetration Testing ◽  
Hash Algorithm ◽  
Brute Force Attack ◽  
Detailed Search

This paper implements a wireless attack technique by cracking the password on kali Linux OS using Hashcat technique. This study identifies the security weakness, using brute-force attack for online attacking and straight attack for offline attacking. The brute-force attack is also recognized as a detailed search, where it attempts guessing the target password one password at a time until reaching the correct password, which is called a dictionary attack. then using hash algorithms to deal with MD5 hash algorithm and SHA-512 (Linux). In this article, we will learn about the various wireless attacks. These days, wireless networks are everywhere. With users being on the go like never before, having to remain stationary because of having to plug into an Ethernet cable to gain Internet access is not feasible. For this convenience, wireless connections are not as secure as Ethernet connections. In this article, we will explore various methods for manipulating wireless attacks and their techniques including several methods on Linux.

Research on Image Encryption Based on Double Chaos System with Mutual Disturbance

2014 ◽  
Vol 701-702 ◽  
pp. 437-441
Author(s):  
J.G. Jin ◽  
Gang Ma ◽  
Ming Jun Wei
Keyword(s):  
Image Encryption ◽  
Security Analysis ◽  
Chaotic Encryption ◽  
Brute Force ◽  
Chaos Encryption ◽  
Overall Evaluation ◽  
Simulation Results ◽  
Image Pixels ◽  
Brute Force Attack ◽  
Low Dimensional

Low-dimensional chaotic encryption has a good operational efficiency but there is a problem of security flaws, therefore this paper proposes a composite chaos encryption system based on double mapping. Double mapping with mutual disturbance were used to generate the key sequence, and respectively with odd and even number of image pixels to realize the image encryption. The simulation results show that, the effect is very good; Correlation and so on security analysis shows that meet the requirements of the security; System overall evaluation results show that the proposed algorithm has better security and ease of implementation, can effectively resist brute force attack, statistic attack etc.

scholarly journals Implementation of Security Enhancement in AES by Inducting Dynamicity in AES S-Box

2019 ◽  
Vol 8 (11) ◽  
pp. 2364-2373
Keyword(s):  
Block Cipher ◽  
Data Encryption ◽  
The Novel ◽  
Brute Force ◽  
Avalanche Effect ◽  
Security Enhancement ◽  
Aes Algorithm ◽  
Dispersion Technique ◽  
Brute Force Attack ◽  
High Computational Complexity

Advance Encryption Standard (AES) supersedes Data Encryption Standard (DES) and is the best known and most widely used block cipher. As for now, there are no known practical attacks that would allow anyone to read correctly implemented AES encrypted data. However, several theoretical attacks have been announced until now. A theoretical attack called Biclique Attack is known to have broken Full AES and requires 2126.1 , 2189.7 , 2254.4 operations to recover an AES-128, AES-192, AES-256 respectively. Biclique Attack is faster than Brute force attack by a factor of four. As such, these theoretical attacks are of high computational complexity; they do not threaten the practical use of AES in any way. However, attacks always get better; they never get worse. As the technology evolves, successful attacks (using Quantum Computing and faster GPU) against AES may turn up, and they may be difficult to ignore. In this study, we aim to enhance the security prospects of AES with the inclusion of Dynamicity character in AES S-Box for increased resilience against Brute Force Attack and Biclique Attack, and hashing technique is combined with AES algorithm to achieve variance in security using MD4, SHA3 or SHA5. The novel key dispersion technique is introduced to increase the avalanche effect of AES algorithm.

scholarly journals A Dynamic DNA Color Image Encryption Method Based on SHA-512

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1091
Author(s):  
Shihua Zhou ◽  
Pinyan He ◽  
Nikola Kasabov
Keyword(s):  
Dna Sequencing ◽  
Image Encryption ◽  
Chaotic Systems ◽  
Color Image ◽  
Brute Force ◽  
Chaotic Sequences ◽  
Initial Values ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Encryption Method

This paper presents a dynamic deoxyribonucleic acid (DNA) image encryption based on Secure Hash Algorithm-512 (SHA-512), having the structure of two rounds of permutation–diffusion, by employing two chaotic systems, dynamic DNA coding, DNA sequencing operations, and conditional shifting. We employed the SHA-512 algorithm to generate a 512-bit hash value and later utilized this value with the natural DNA sequence to calculate the initial values for the chaotic systems and the eight intermittent parameters. We implemented a two-dimensional rectangular transform (2D-RT) on the permutation. We used four-wing chaotic systems and Lorentz systems to generate chaotic sequences and recombined three channel matrices and chaotic matrices with intermittent parameters. We calculated hamming distances of DNA matrices, updated the initial values of two chaotic systems, and generated the corresponding chaotic matrices to complete the diffusion operation. After diffusion, we decoded and decomposed the DNA matrices, and then scrambled and merged these matrices into an encrypted image. According to experiments, the encryption method in this paper not only was able to withstand statistical attacks, plaintext attacks, brute-force attacks, and a host of other attacks, but also could reduce the complexity of the algorithm because it adopted DNA sequencing operations that were different from traditional DNA sequencing operations.

Sign in / Sign up

Export Citation Format

Share Document