INTERNATIONAL CONFERENCE ON “CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION -2009, 4th-6th June 2009

UNOFFICIAL HACKING ALGARITHMS

Mamatha G
Asst.Professor, Dept. of MCA
Achrya Institute of Technology
Soldevanahalli,Bangalore-90
E-Mail: bmsgm@yahoo.com
Ashoka B M
Department of MCA
Acharya Institute of Technology
Soldevanahalli, Bangalore-9
E-Mail: asbm_sagar@yahoo.co.in

ABSTRACT: Computer hacking is the practice of modifying computer hardware and software to
accomplish a goal outside of the creator’s original purpose. People who engage in computer hacking
activities are often called hackers. Since the word “hack” has long been used to describe someone who is
incompetent at his/her profession, some hackers claim this term is offensive and fails to give appropriate
recognition to their skills.

In this research paper highly focus on hacking of security systems. The hacking algorithms are
implemented and used for the breaking a security system.

KEY WORDS: Hacking, permutations, combinations, comparison, bit operation, shift Bits.
—————————— ‹ ——————————

1 INTRODUCTION

Hacking a security system is not a easy task

T HE Computer hacking is most common
among teenagers and young adults, although
there are many older hackers as well. Many
hackers are true technology buffs who enjoy
learning more about how computers work and
consider computer hacking an “art” form. They
often enjoy programming and have expert-level
skills in one particular program. For these
individuals, computer hacking is a real life
application of their problem-solving skills. It’s a
chance to demonstrate their abilities, not an
opportunity to harm others.
Computer hacking can also lead to other
constructive technological developments, since
many of the skills developed from hacking apply
to more mainstream pursuits. For example, former
hackers Dennis Ritchie and Ken Thompson went
on to create the UNIX operating system in the
1970s. This system had a huge impact on the
development of Linux, a free UNIX-like operating
system. Shawn fanning, the creator of Napster, is
another hacker well known for his
accomplishments outside of computer hacking.
the author implemented the probability
[permutation and combination] concept can
be applied for implementing the hacking
algorithms the different algorithms are
1. Password Hacking algorithm [PHA]
2. Finger Print Hacking algorithm [FPA]
RELATED WORKS
The key ASCII [American national code for
information interchange] code can be used
for the accept a key value. Each key in the
keyboard have contains unique key code [4].
The 256 key codes [ASCII] available in all
the types of keyboards. If you press
On one key on the keyboard then the actual
key code passes on to the system.
For example if you press on the Esc key then
its equilent ASCII 27 key code will [pass to
the system it identifies as a 27 in the escape
key.
INTERNATIONAL CONFERENCE ON “CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION -2009, 4th-6th June 2009

1. PASSWORD HACKING ALGORITHM.

[If it is digit o to 9]
[a….z] If key >65 and key key< 92
[A….Z] X[r] = key [j]
End if
[0….9] If key > 97 and key<122
[#,$….] X[R] = key [K]
If key > 47 and key < 58
[0….9] [$.#..] Key [R] = key [L]
[0….9] [$.#..] End if
Combine a with [a….z] End for
Combine a with [0….9] End for
Combine a with [$.....#] End for

Alphabets; a -z 26 letters In this algorithm combine first algorithm

A-Z- 26 LETTERS with the remaining 25 alphabets it may be a
0-9 10 DIGITS capital or small case , and 0 to 9 digits and
#, $ special characters .The length of the
Combinations: Letter ‘a’ with 26 letters password is less than it take less time for
[a…z] 26 X 26 execution of algorithm. If the combined
= 676 word matches with the actual password
[A…Z] 26 X 26 then the gateway will open. The next
=676 execution of application then this algorithm
676 X 676 = 4, 56,976 letters stops execution. The key*^ the array of list it
will stores the combined words. R is the
[0…9] X =10 X 10 =100 resulted string array. Each time loop
=4, 56,976 X 100 executes then interrupt pass on to the
=456, 97,600 focused password text field. Task switching
operation can be concurrently performed
[Computer input it is alphabet a to z or A to Z] during the execution of PBA algorithm.

For I from 0 to 25 2. FINGER PRINT HACKING ALGORITHM.

X [ i] = key [ I ]
End for

[Input if it is digit is 0 to 9] 0101010

For j from 0 to 9.
X [j] = key [j] 0010110
End For 0010101
[Input if it is special char (*, $, # etc)] 1101000
For k from 0 to 8. Finger print Matrix Data
X[k] = key [k].
End for
rd
Take a compliment of first row and 3 row
nd
[Perform one operation computer with different .apply the left shift operator << for 2 and
th
combinations] 4 row. Compare the actual matrix with
For j from 0 to 26^ 8 operated matrix.
[it is is small letter a-z]
For k from 0 to 9^8
[if it is capital A-Z]
For i from 0 to 8^8
INTERNATIONAL CONFERENCE ON “CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION -2009, 4th-6th June 2009

If x[i,j] = =0 then
x[i,i] =1 ;
010101 - 1010101 Else
<< 0010110 - 0101110 x [i,j] = 0:
End if
0010101 - 1 101010
If x [3, i] = =0 then
<<1101000- 0010111 x[3,i] = 1 ;
Shift Bits on the Matrix Table Else
x [3,i] = 0i
End if
End for
End for
010101 - 1010101
<< 0010110 - 0101110 [Apply the left shift operation to the 2 and
nd

0010101 - 1 101010 th
4 row]
<<1101000- 0010111
Actual Matrix Operated Matrix For i from 0 to 7
For j from 7 to 8
Shift [2,1] = shift [2,1]+1
Res [i,j] = bitwise (x[I,j]<<shift [i, j ]);
Repeatedly shift all 8 bits until the nearest match
Shift [4, i] = shift [4, i] +4;
find in the actual matrix in this algorithm bitwise
Res [i,j] = bitwise (x[i,j] << shift [i,j]);
operation can be applied for the finding a nearest
End for
matching combination of bits. Only 0 and 1 can be
End for
used in this comparison of matrix .The left shift
operator shifts one bit it may be 0 or 1 to the left
side in the sense multiplying by two repeatedly
[Compare actual matrix with operated
different combination bits generated and compare
matrix]
with the actual matrix. These is no need of
For i from 0 to n-4
accurate matching of bits .70% of the match found
For j from 0 to n-i-4
in the actual matrix with operated matrix then the
if res [i,j] = x [ i,j] then
system will allow grant across permission , to the
Print (“Access granted”);
user.
End if
End for
ALGORITHM
End for
[Read data [finger print data] from database]
for I from 0 to n-1
In the FPA algorithm res [i,j] contains the
for I from 0 to n-i-1
actual matrix and x[I,j] contains the
Read [i,j] =dbase [i,j]
operated matrix.
End for
End for
STIMULATION AND TESTING
[split the data into matrix from 8 bits]
The password breaker algorithm highly
For I from 0 to 7
effective and more efficient for testing
For j from 0 to 7-i-4
results of this algorithm.
Temp [I, J] = Read [I, j]
End for
End for
st rd
[Complement 1 and 3 row data]
For I from 0 to 7
For j from 1 to 8
INTERNATIONAL CONFERENCE ON “CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION -2009, 4th-6th June 2009

image file. From the image, fingerprint

recognition algorithm extracts unique
features of each fingerprint and saves them
in the database. For fingerprint verification,
features of an input fingerprint are
compared to the features of a specific
fingerprint data in the database.

In this algorithm, we can Access data from

database and Create dummy data using of
bit manipulation. Using of shifting of bits
this algorithm breaks fingerprint Security
system.

ACKNOWLEDGMENT

The authors would like to thank Indian

Institute of Science for the help in
Development of Unofficial Hacking
algorithms. The authors would also like to
thank Acharya Institute of Technology for
CONCLUSIONS the comments regarding the Password
Hacking and Fingerprint Hacking.
Most accounts on a computer system usually have
some method of restricting access to that account, REFERENCES
usually in the form of a password. When accessing
the system, the user has to present a valid ID to [1] Let Us ‘C’, Author Balaguruswamy.
use the system, followed by a password to use the
account. Most systems either do not echo the [2]Fundamentals of Database System
password back on the screen as it is typed, or they AuthorElsmari, Navathe, Somayajulu,
print an asterisk in place of the real character. Guptha

In this system,the password is typically Execute [3]The UNIX Operating System.

through some type of algorithm to generate a
Charactors. The Different combination of ascii [4]http://www.wikipedia.com/AsciiCodes
Charactors used For cracking of password.
[5] Analysis and design of Algorithms.
The fingerprint is the most reliable kind of
personal identification because it cannot be
forgotten, misplaced, or stolen. Fingerprint
authorization is potentially the most affordable
and convenient method of verifying a person's
identity.

The lines that create a fingerprint pattern are

called ridges and the spaces between the ridges
are called valleys. It is through the pattern of these
ridges and valleys that a unique fingerprint is
matched for verification and authorization.

The fingerprint pattern is captured by fingerprint

sensors. Fingerprint sensors work by taking a
snapshot of a fingerprint and saving it into an
INTERNATIONAL CONFERENCE ON “CONTROL, AUTOMATION, COMMUNICATION AND ENERGY CONSERVATION -2009, 4th-6th June 2009

AUTHORS

Mamatha G is a Assistant professor of Master of

Computer Applications Department, Acharya
Institute of Technology and where she is also
Placement incharge of department. She received a
MCA, ME in Computer Science. Research interests
include Networking and applications.

Contact the authors at MCA department,

Acharya Institute of Technology,
Soldevanahalii, Bangalore-90,
E-mail: bmsgm@yahoo.com
PH - 9945744833

Ashoka B M is a Final Year Student of Master of

Computer Applications Department, Acharya
Institute of Technology and where he is Also
Software Programmer of Internet Systems Pvt Ltd.
Research interests include Networking and
applications.

Contact the authors at MCA department,

Acharya Institute of Technology,
Soldevanahalii, Bangalore-90,
E-mail: asbm_sagar@yahoo.co.in
PH - 9986831982