scholarly journals Analysis Dictionary Attack Dan Modifikasi Password Cracking Serta Strategi Antisipasi

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Sayed Achmady

Dalam konteks kriptanalisis dan keamanan komputer, dictionary attack adalah sebuah teknik untuk melawan cipher atau melawan mekanisme otentikasi dengan cara menentukan kunci dekripsi dengan mencari kemungkinan kombinasi kata yang terdapat di dalam sebuah kamus [1]. Pada dasarnya dictionary attack adalah pengembangan dari brute force attack, yaitu mencoba memecahkan kode dengan mencoba satu per satu kemungkinan secara berulang (exhaustive search). Akan tetapi dictionary attack bukan mencoba kombinasi satu per satu karakter yang tersedia seperti brute force, melainkan mencoba kombinasi kata yang paling mungkin berhasil dengan input sebuah “list of kata” yang dapat didefinisikan (disebut juga kamus), yang biasanya berasal dari daftar kombinasi kata-kata umum yang terdapat dalam kamus, misalnya kamus bahasa Inggris. Dictionary attack merupakan serangan yang sangat efektif untuk memecahkan kode dan sering digunakan hacker untuk membobol sistem keamanan yang berupa password, seperti akun email, akun jejaring sosial, halaman administrator situs web, dan lain-lain. Dictionary attack dianggap efektif karena memanfaatkan psikologi manusia, yaitu kebiasaan bahwa pengguna akun akan menggunakan kata-kata yang lumrah dan mudah diingat sebagai password suatu akun tertentu [2]. Selain itu, dictionary attack juga dikembangkan variasinya dan semakin tinggi efektivitasnya, sehingga hingga saat ini teknik ini masih sering digunakan untuk membobol password pengguna sebuah akun. jurnal ini membahas mengenai studi dictionary attack mengenai penjelasan singkat, prinsip kerja, dan bagaimana pengembangan dari dictionary attack dalam konteks penerapannya untuk membobol password sebuah akun tertentu. Variasi dari dictionary attack yang akan dibahas dalam makalah ini yaitu dictionary attack, hybrid dictionary attack, dan pre-computed dictionary attack. Selain itu, pada makalah ini akan dianalisis kelebihan dan kelemahan dictionary attack dan masing-masing modifikasinya, serta solusi yang dapat dilakukan dalam melawan dictionary attack. Kata kunci: Dictionary Attack, password, brute force, kamus, list of hash.

2012 ◽  
Vol 532-533 ◽  
pp. 1080-1084 ◽  
Author(s):  
Zhi Cai Shi ◽  
Can Qun Yang ◽  
Qiang Wu

MD5 Crypt is a cryptographic algorithm used commonly in UNIX system for authentication. Thanks to the additional randomization of the salt and complexity of the scheme, it makes the traditional password cracking techniques invalid on common computing systems so that the security of the system is guaranteed. As a result of the thriving of petaflops heterogeneous supercomputer system in recent decades, the security of MD5 Crypt is facing a threat of brute-force attack again. However, the complexity of heterogeneous programming and the sophistication of large-scale parallelism still hamper the password recovering. In this paper, we implemented brute-force attack of MD5 Crypt on Tianhe-1A,the world’s fastest supercomputer, by organizing the assignment between CPU and GPU reasonably and making several optimizations according to MD5 Crypt for GPU. Based on the experimental results, our algorithm achieves a great scalability. It checked more than 1.8 billion passwords in a second on the full system. Thus it issues a new challenge to the security of MD5 crypt for authentication.


2021 ◽  
Vol 10 (1) ◽  
pp. 7
Author(s):  
Renas R. Asaad

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.


The main aim of this paper is to provide confidentiality, integrity to the message. It Encrypts the message when it is passing from the sender side to the receiver side. If we take the Caesar cipher it is weak against the brute force attack, dictionary attack but this algorithm is stronger against the brute-force attack and dictionary attack. It has both private and public key encryption which is unlikely for other encryption algorithms like hill cipher, play fair cipher etc. Some Encryption algorithms will prone to be attacked with man-in-the-middle attack but this will be overcome with using hash code concept. This proposal encrypts the message with the novel algorithm at the client side and does the counterpart at the server side. Algorithm implemented using python programming and proves our algorithm is stronger against brute force and dictionary attacks.


2017 ◽  
Vol 10 (3) ◽  
pp. 1 ◽  
Author(s):  
Mohannad Najjar

Password storage is one of the most important cryptographic topics through the time. Different systems use distinct ways of password storage. In this paper, we developed a new algorithm of password storage using dynamic Key-Hashed Message Authentication Code function (d-HMAC). The developed improved algorithm is resistant to the dictionary attack and brute-force attack, as well as to the rainbow table attack. This objective is achieved by using dynamic values of dynamic inner padding d-ipad, dynamic outer padding d-opad and user’s public key as a seed.


Nowadays in information security user authentication is a very important task. In most of the computer, user authentication depends on the alphanumeric username and password. It means text-based password. But, this is not highly secure because of hackers can easily break the password. Brute force attack, dictionary attack, guessing attack etc. these all are some possible attacks on the password. If the user chooses a difficult password to prevent the system from the attackers which is very much harder for the user to remember such a difficult password. So, to resolve this problem introduced a new technique called graphical password authentication. This paper presents a detailed survey of user authentication techniques using a graphical password. It contains basically two type approaches. They are recognition-based and recall-based approaches. This survey discusses the different techniques about Graphical password authentication and their advantages and limitations. The survey provides a roadmap for the development of new graphical authentication scheme.


2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim

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