International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 5 683 686

_______________________________________________________________________________________________
Identify Cryptanalytic Brute-Force Attack Using Frequent Pattern Mining

Jitendra Jain Dr. Parashu Ram Pal

Research Scholar, Faculty of Computer Science Professor, MCA
Pacific Academy of Higher Education & Research University, Lakshmi Narain College of Technology,
Udaipur, Rajasthan, India Bhopal, M.P., India
e-mail:jitendra1974@gmail.com e-mail: prpal@rediffmail.com

Abstract: A brute-force attack consists of an attacker trying many passwords or passphrases with the hope of eventually guessing correctly.
The attacker systematically checks all possible passwords and passphrases until the correct one is found. Alternatively, the attacker can attempt
to guess the key which is typically created from the password using a key derivation function. This is known as an exhaustive key search. In this
paper we proposed a new approach based on pattern mining of data mining techniques. We have taken 10 values which is most commonly used
for passed. In the proposed approach we find most common things that used for password by most of the user.
Keywords: - Password, attacker, key, encryption, brute-force attack.

__________________________________________________*****_________________________________________________
I. INTRODUCTION
A brute-force attack is a cryptanalytic attack that can, in
theory, be used to attempt to decrypt any encrypted data. Brute
force (also known as brute force cracking) is a trial and error
method used by application programs to decode encrypted
data such as passwords or Data Encryption Standard (DES)
keys. Such an attack might be used when it is not possible to
take advantage of other weaknesses in an encryption system (if
any exist) that would make the task easier.
When password is guessing, this method is very fast. It is used
to check all short passwords, but for longer passwords other
methods such as the dictionary attack are used because a
brute-force search takes too long. Longer passwords,
passphrases and keys have more possible values, making them
exponentially more difficult to crack than shorter ones. [1]
Brute-force attacks can be made less effective
by obfuscating the data to be encoded making it more difficult
for an attacker to recognize when the code has been cracked or
by making the attacker do more work to test each guess. One
of the measures of the strength of an encryption system is how
long it would theoretically take an attacker to mount a
successful brute-force attack against it.
Brute-force attacks are an application of brute-force search,
the general problem-solving technique of enumerating all
candidates and checking each one.
The act of password cracking has been closely related to the
Information Security field because passwords were the first
means of protecting data and restricting access to it. Passwords
are still widely used nowadays and remain the most popular
way of adding security to confidential information. Because of
this, there is a wide range of attacks against passwords.
Authentication mechanisms have evolved during the past years
but there is still no way to completely avoid user involvement.
The human factor is the one that is usually responsible for the
selection of an insecure or predictable password. Encryption
algorithms are usually widely tested and the ones that are
commonly used have been proven to be secure. Therefore, an
attacker will almost always try to attack the predictability of
the human factor instead of trying to break the encryption. Due
to the recent increase in incidents involving public disclosure
of personal information (including passwords), it is now easier
to compile extremely accurate statistical information to
identify most commonly used passwords and the patterns that
lead of the selection of those passwords. Different users
involved in various projects related to password cracking
amongst which some related to distributed password cracking,
rainbow table generation and CPU and GPU based password
cracking. It has been noticed that the most successful
techniques used to crack passwords nowadays include rules
that were compiled from the analysis of great volumes of
actual passwords. Therefore, the objective of this paper is to
test all commonly used password cracking techniques. This
implementation will then compare their success rate to
proposed technique given in this paper which involves the
addition of rule sets based on known password patterns and
incrementally taking into consideration the analysis of the
already cracked passwords.
II. WORKING OF BRUTE FORCE ATTACK
Hackers can try to get into users system using a few different
methods. Methods are shown in Figure 1.
1. Manual login attempts: In this approach, they will try to
type in a few usernames and passwords
2. Dictionary based attacks: In this approach, automated
scripts and programs will try guessing thousands of usernames
and passwords from a dictionary file, sometimes a file for
usernames and another file for passwords.
3. Generated logins: A cracking program will generate
random usernames set by the user. They could generate
numbers only, a combination of numbers and letters or other
combinations. The working of Brute force attack is shown in
Figure 2.

683

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 683 686
_______________________________________________________________________________________________

Manual Login Attempts

Brute
Force Attack

Dictionary Based Attacks Generated Logins

Figure 1 Methods of Brute Force Attack

III. BLOCKING OF BRUTE FORCE ATTACK

The blocking of brute force attack are as follows:

1. Locking Account
If a user attempts a wrong password many times then the user's
account will be blocked for a given time of period. Outlook
accounts are locked after a wrong password tries. If an
attacker attempts a Brute Force Attack on many accounts then
a Denial of Services (DOS) problem emerges. If attackers
want to lock an account then they continues to hit that account
and the resultant admin is again locked from the account

2. Delay the login process

Increasing time delay for login to stop brute forcing. More
attempts a hacker uses to guess a password, more time does it
take to check every time. After checking 100 passwords he
must wait 5 sec between each try. We should try not to use
Sleep () because it uses CPU cycles, and if you have a brute
force attack from 10,000 IP addresses you will fork 10,000
sleep() child process or threads, this will cause load on your
server.

3. Block the hacker IP

Simply block the IP address where the brute force attack Figure 2 Working of Brute Force Attack
comes. Some companies avoid using this way because
sometimes a user might forget his password and tries to login Blocking of Brute Force Attack
several times. But the result is that the erver deal with him as a
hacker and blocks his IP.
Figure 3 has shown the blocking of brute force attack. Locking Account

Delay the login process

Block the hacker IP

Figure 3 Methods to Protect Brute Force Attack

684

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 5 Issue: 5
_______________________________________________________________________________________________
IV. LITERATURE REVIEW
In 2012 Bahaa Qasim proposed Preventing Brute Force
Attack through the Analyzing Log. They examines attacks
depending on SSH log file to find unsuccessful logins then
blocks IP addresses of unsuccessful logins for a period of time
that is decided by administrator and then send an e-mail to
administrator to consider whether the addresses blocked
belong to users failed to access or by an attacker, finally the
administrator will block attacker's IP address forever. Some
attackers highly skilled and just used trusted IP address as a
user name then the
Software will block the IP address of attacker as well as the
victim IP address that is used by attacker. They proposed an
adaptive mechanism to distinguish between attacker IP address
and victim IP address which may be used by an attacker, and
then the program will block just attacker IP address [2].
In 2013 Konark Truptiben Dave proposed Brute-force Attack
Seeking but Distressing A brute force attack can be very
effective at compromising your web application unless proper
defenses are used. A Brute-force attack can be a dangerous
one to your system if carelessness is taken. With the above
strategies these types of attack can be avoided [3].
In 2013 Ashwini .J proposed Authentication for Attacks in
Graphical Passwords Pass Points Style. They proposed
graphical passwords based approach to make passwords more
memorable and easier for people to use. Using graphical
passwords users click on images rather than type alphanumeric
characters. User designed a new and more secure graphical
password system called pass points. Based on click-order
patterns we introduced proposed graph-based algorithms to
create dictionaries with focus-of-attention scan paths [4].
In 2014 Vaishali K. Kosamkar et al Implementation and
Analysis of Password Guessing Resistant Protocol (PGRP): A
Literature Survey. They proposed a modify PGPRP
algorithm which increases security level at good extend which
can be used to apply at any application which is going to
require high level of authentication. They compare Modified
PGPRP, Stander PGPRP, VS and PS algorithm in terms of
time taken by that algorithm to get successful access [5].
In 2014 Satomi Honda Detection of Novel-Type Brute Force
Attacks Used Ephemeral Springboard IPs as Camouflage.
They showed systematic brute force attack instances from
actual network monitoring logs by visualization focused on
source IPs and detection time. One of the instances shows that
specific terminals have been attacked used innumerable IPs for
a long time. This IPs was like ephemeral because they had
appeared almost only one time. They proposed a new system,
DEMITASSE, for detecting such terminals in the earlier phase
and mitigating the damage caused by brute force attacks used
ephemeral IPs [6].
In 2015 Mohammed Farik et al proposed Algorithm to
Ensure and Enforce Brute-Force Attack-Resilient Password in
Routers They proposed a new algorithm to prevent entry of
passwords that fail even a single condition. For a password to
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
683 686
be accepted, it should pass all the three conditions of length,
cardinality, and entropy. Classification tests carried out on the
algorithm using sample test data reveal 100% classification
accuracy in accepting a strong password, and in rejecting a
weak password. Analysis has shown significant improvements
in passwords accepted via the new algorithms when compared
to current default router passwords. Moreover, 100% of the
passwords that were accepted via this algorithm proved to be
strong and unbreakable using brute-force method on a GPU
based PC [7].
In 2016 Adwan Yasin proposed Enhance Rfid Security
against Brute Force Attack Based on Password Strength and
Markov Model. They showed weaknesses of RFID system
and identifies the threats and countermeasures of possible
attacks. They also designed a algorithm to ensure and
measure the strength of passwords used in the authentication
process between tag and reader to enhance security in
their communication and defend against brute-force
attacks. Proposed algorithm is design by modern techniques
based on entropy, password length, cardinality, Markov-
model and Fuzzy Logic [8].
V. PROPOSED APPROACH
Frequent item set mining leads to the discovery of associations
and correlations among items in large transactional or
relational data sets. With massive amounts of data
continuously being collected and stored, many industries are
becoming interested in mining such patterns from their
databases. The discovery of interesting correlation
relationships among huge amounts of business transaction
records can help in many business decision-making processes,
such as catalog design, cross-marketing, and customer
shopping behavior analysis. A typical example of frequent
item set mining is market basket analysis. This process
analyzes customer buying habits by finding associations
between the different items that customers place in their
shopping baskets. The discovery of such associations can
help retailers develop marketing strategies by gaining insight
into which items are frequently purchased together by
customers.
A new approach has been proposed to identify combination
used for passed by different user. Some 10 attributes have
been for this purpose. The attributes or parameters description
is named as with their parameter type are I1 as Name, I2 as
DOB, I3 as Anniversary Date , I4 as Child's name , I5 as PAN
number, I6 as Mobile Number , I7 as Aadhar number , I8 as
Vehicle number, I9 as License numbers and I10 as House
Number . By using simple 10 records it can seen that some
people used single attribute as a password .Some of the people
used combination of two attribute as a password and some
used combination of three attribute as a password.
VI. EXPERIMENTAL ANALYSES
The sample 0f 1000 persons have been taken as data using
different social networking site. There are 10 attribute are used
which are most commonly used as password by the person.
Proposed approach has been implemented in VB. Net 2010
685
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 683 686
_______________________________________________________________________________________________
and SQL server. Table 1 shows the single attribute as a
password by different number of users. Table 2 shows the
combinations of two attributes as a password by different
number of users.

Table 1 Single Attribute as Password

Number of person
Attribute Name
used as password
Name 301
DOB 297
Anniversary date 102
Child's name 67
Mobile Number 201
Vehicle number 32 Figure 5 Combination of two attribute as password

VII. CONCLUSIONS
Table 2 Combination of two attributes as password The paper is proposed how people used password as a most
common attribute in real life. Brute force attack used special
Number of person used code to which used several combination of attribute to crack
Attribute name
as password password. Common information of the people is easily
Name & DOB 308 available on internet and spicily on social site. This
information is used by brute force e attacker to crack
Name & Mobile No 310
password. In future we need to work on graphical option based
Child name & DOB 207 password.
Name & Anniversary
124 REFERENCES
date
[1] Curtin, Matt, Brute Force Cracking the Data Encryption
Name &Vehicle
51 Standard, First Edition, Copernicus, 2005.
number
[2] Bahaa Qasim et al Preventing Brute Force Attack through
igure 4 shows the graph for the single attribute as a password
the Analyzing Log Iraqi Journal of Science, 2012, vol.53,
by different number of users. Figure 5 shows the graph for the
No.3, pp 663-667.
combinations of two attributes as a password by different
[3] Konark Truptiben Brute-force Attack Seeking but
number of users.
Distressing International Journal of Innovations in
Engineering and Technology Vol. 2 Issue 3 June 2013
[4] Ashwini.J Authentication For Attacks In Graphical
Passwords Pass Points Style International Journal of
Advances In Computer Science and Cloud Computing, ISSN:
2321-4058 Volume- 1, Issue- 1,May-2013.
[5] Vaishali K. Kosamkar Implementation and Analysis of
Password Guessing Resistant Protocol (PGRP): A Literature
Survey International Journal of Advance Foundation and
Research in Computer (IJAFRC) Volume 1, Issue 12,
December 2014. ISSN 2348 4853
[6] Satomi Honda, Detection of Novel-Type Brute Force
Attacks Used Ephemeral Springboard IPs as Camouflage
Journal of Advances in Computer Networks, Vol. 2, No. 4,
Figure 4 Single Attribute as Password December 2014
[7] Mohammed Farik Algorithm To Ensure And Enforce Brute-
Force Attack-Resilient Password In Routers International
Journal Of Scientific & Technology Research Volume 4,
Issue 10, October 2015 ISSN 2277-8616.
[8] Adwan Yasin Enhance Rfid Security against Brute Force
Attack Based On Password Strength And Markov Model
International Journal of Network Security & Its Applications
(IJNSA) Vol.8, No.5, September 2016.

686

IJRITCC | May 2017, Available @ http://www.ijritcc.org

_______________________________________________________________________________________