Peningkatan Keamanan Kriptografi Caesar Cipher dengan Menerapkan Algoritma Kompresi Stout Codes

2020 ◽  
Vol 4 (6) ◽  
Author(s):  
Mesran Mesran ◽  
Surya Darma Nasution
Keyword(s):  
Data Compression ◽  
Compression Algorithm ◽  
Brute Force ◽  
Test Results ◽  
Encrypted Data ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Cryptographic Security

The development of applications that can crack passwords or data that has been secured by cryptographic algorithms has made researchers try various ways to further secure the data they have. Even though the method used is quite modern, the algorithm for breaking ciphertext in cryptography can still be created. For this reason, in this study the authors develop cryptographic security by combining it with data compression. In this study, the algorithm used is the classic cryptographic algorithm, namely Caesar Cipher, combined with the Stout Codes compression algorithm. The results of the Caesar Cipher ciphertext are then compressed by applying the Stout Codes algorithm. From the test results using the Brute Force Atack model, the results are quite good, that the security of the encrypted data is quite good and not easily broken.

Brute Force Attack pada Algoritma SHA-256

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Sandromedo Christa Nugroho
Keyword(s):  
United States ◽  
Information Processing ◽  
Hash Function ◽  
Search Process ◽  
Brute Force ◽  
Cryptographic Algorithms ◽  
Cryptographic Security ◽  
Brute Force Attack ◽  
United States Standard

Brute force attack adalah salah satu serangan praktis (bersifat praktek) yang dapat digunakan untuk memecahkan teknik pengamanan kriptografi dengan cara mencoba seluruh kemungkinan jawaban/kunci yang ada. Secara umum seluruh jenis algoritma kriptografi dapat dipecahkan dengan menggunakan brute force attack, namun dalam pelaksanaannya brute force attack memerlukan perangkat, power, trials, waktu dan memory yang sangat besar, dimana semakin kompleks teknik/informasi yang harus dipecahkan, maka proses pencarian solusinya akan semakin lama, sehingga dalam hal ini terdapat pertimbangan terhadap kemunculan faktor keberuntungan (luck) untuk menemukan solusi serangan. Pada tulisan ini akan dibahas mengenai teknik dan paramter yang dibutuhkan dalam melakukan brute force attack terhadap password yang telah dihash dengan menggunakan algoritma SHA-256, yaitu algoritma fungsi hash standar Amerika Serikat berdasarkan pada dokumen NIST Federal Information Processing 180-3 – Secure Hash Standard (SHS).   Brute force attack is one of the practical attacks that could be used to solve cryptographic security techniques by trying all possible answers / keys. Generally, all types of cryptographic algorithms could be solved by using brute force attack, but practically brute force attack implementation requires huge devices, powers, trials, times and memories, where the more complex techniques / information to be solved, means the longer search process will be, beside also considers the emergence of luck factor to find an attack solution. This paper will discuss about the techniques and parameters required in performing brute force attack against passwords that have been hashed using SHA-256 algorithm, that is United States standard hash function algorithm based on NIST document Federal Information Processing 180-3 - Secure Hash Standard (SHS).

scholarly journals Implementasi Algoritma Advanced Encryption Standard (AES) pada Layanan SMS Desa

2020 ◽  
Vol 5 (3) ◽  
pp. 153
Author(s):  
Intan Fitriani ◽  
Aryo Baskoro Utomo
Keyword(s):  
Data Security ◽  
Short Message Service ◽  
Advanced Encryption Standard ◽  
Short Message ◽  
Brute Force ◽  
Test Results ◽  
Avalanche Effect ◽  
Cryptographic Algorithms ◽  
Message Service

Along with the development of technology, Short Message Service (SMS) has begun to be used to communicate between someone and the system in an agency. But in some cases, the security of messages sent through the SMS application has not been well protected. To improve data security and confidentiality, cryptographic algorithms with Advanced Encryption Standard (AES) can be done. The method used is the Waterfall method. AES encryption testing is done by comparing the manual calculations and the results of the encryption on the system. Blackbox test, CrackStation test, and Avalanche Effect (AE) test were also carried out. Brute force test results using CrackStation software that ciphertext cannot be solved. And in the avalanche effect (AE) test, the AE value of each 128-bit AES key is 44.53%, 192-bit is 48.44%, and 256-bit is 56.25%. Therefore, 192-bit and 256-bit AES keys are recommended for use because AE values are in the range of 45% - 60%.

A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion

2020 ◽  
Vol 13 (3) ◽  
pp. 435-445 ◽  
Author(s):  
Malik Qasaimeh ◽  
Raad S. Al-Qassas ◽  
Fida Mohammad ◽  
Shadi Aljawarneh
Keyword(s):  
Processing Time ◽  
Block Size ◽  
Statistical Test ◽  
Mathematical Proofs ◽  
The Past ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Compare And Contrast ◽  
Constrained Devices

Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

Sign in / Sign up

Export Citation Format

Share Document