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.

Immensely Discriminate Routing in Wireless Networks

2017 ◽  
Vol 8 (3) ◽  
pp. 712
Author(s):  
Sujatha V ◽  
E. A. Mary Anitha
Keyword(s):  
Wireless Networks ◽  
Wireless Network ◽  
Routing Protocol ◽  
Real Life ◽  
Internet Access ◽  
Multimedia Traffic ◽  
Multihop Routing ◽  
Routing Schemes ◽  
Scalable Routing

Wireless networks are predictable to grant essential Internet access multimedia traffic service also increasingly such networks have been emerged in real life. However, the application scenarios is indeterminate as well as largely scalable routing is very difficult. Thus require efficient routing schemes in wireless network. In this paper, we propose Immensely Discriminate Routing protocol is used for multihop routing in wireless network. Here, node distance, node link, node trust and node quality of service is evaluated the next hop. This parameters are determined an efficient path in the wireless network.

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

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Sayed Achmady
Keyword(s):  
Exhaustive Search ◽  
Brute Force ◽  
Dictionary Attack ◽  
Brute Force Attack ◽  
Password Cracking

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.

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 Smart Security Algorithm: Ensured Confidentiality and Integrity

2019 ◽  
Vol 9 (1) ◽  
pp. 1994-1998
Keyword(s):  
Brute Force ◽  
Dictionary Attack ◽  
Server Side ◽  
Hill Cipher ◽  
Man In The Middle ◽  
Private And Public ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Python Programming ◽  
Client Side

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.

scholarly journals Using Improved d-HMAC for Password Storage

2017 ◽  
Vol 10 (3) ◽  
pp. 1 ◽  
Author(s):  
Mohannad Najjar
Keyword(s):  
Public Key ◽  
Message Authentication ◽  
Brute Force ◽  
Message Authentication Code ◽  
Dictionary Attack ◽  
Authentication Code ◽  
Rainbow Table ◽  
Brute Force Attack ◽  
Dynamic Key ◽  
Improved Algorithm

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.

scholarly journals Research and Development of User Authentication using Graphical Passwords: A Prospective Methodology

2019 ◽  
Vol 8 (9S3) ◽  
pp. 385-390
Keyword(s):  
User Authentication ◽  
Brute Force ◽  
Computer User ◽  
Dictionary Attack ◽  
Password Authentication ◽  
Graphical Password ◽  
Graphical Passwords ◽  
A New Technique ◽  
Guessing Attack ◽  
Brute Force Attack

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.

Demand of Wireless Network and Security in Current Research

2015 ◽  
Vol 14 (6) ◽  
pp. 5809-5813
Author(s):  
Abhishek Prabhakar ◽  
Amod Tiwari ◽  
Vinay Kumar Pathak
Keyword(s):  
Wireless Networks ◽  
Quality Of Service ◽  
Wireless Network ◽  
Network Performance ◽  
Wireless Security ◽  
Human Intervention ◽  
Unauthorized Access ◽  
Quality Of Service Parameters ◽  
Wireless Infrastructure

Wireless security is the prevention of unauthorized access to computers using wireless networks .The trends in wireless networks over the last few years is same as growth of internet. Wireless networks have reduced the human intervention for accessing data at various sites .It is achieved by replacing wired infrastructure with wireless infrastructure. Some of the key challenges in wireless networks are Signal weakening, movement, increase data rate, minimizing size and cost, security of user and QoS (Quality of service) parameters... The goal of this paper is to minimize challenges that are in way of our understanding of wireless network and wireless network performance.

scholarly journals Planning capacity for 5G and beyond wireless networks by discrete fireworks algorithm with ensemble of local search methods

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Hafiz Munsub Ali ◽  
Jiangchuan Liu ◽  
Waleed Ejaz
Keyword(s):  
Wireless Networks ◽  
Local Search ◽  
Wireless Network ◽  
Statistical Tests ◽  
Mathematical Framework ◽  
Integer Programming Problem ◽  
Search Methods ◽  
Fireworks Algorithm ◽  
Local Search Methods ◽  
Planning Capacity

Abstract In densely populated urban centers, planning optimized capacity for the fifth-generation (5G) and beyond wireless networks is a challenging task. In this paper, we propose a mathematical framework for the planning capacity of a 5G and beyond wireless networks. We considered a single-hop wireless network consists of base stations (BSs), relay stations (RSs), and user equipment (UEs). Wireless network planning (WNP) should decide the placement of BSs and RSs to the candidate sites and decide the possible connections among them and their further connections to UEs. The objective of the planning is to minimize the hardware and operational cost while planning capacity of a 5G and beyond wireless networks. The formulated WNP is an integer programming problem. Finding an optimal solution by using exhaustive search is not practical due to the demand for high computing resources. As a practical approach, a new population-based meta-heuristic algorithm is proposed to find a high-quality solution. The proposed discrete fireworks algorithm (DFWA) uses an ensemble of local search methods: insert, swap, and interchange. The performance of the proposed DFWA is compared against the low-complexity biogeography-based optimization (LC-BBO), the discrete artificial bee colony (DABC), and the genetic algorithm (GA). Simulation results and statistical tests demonstrate that the proposed algorithm can comparatively find good-quality solutions with moderate computing resources.

Sign in / Sign up

Export Citation Format

Share Document