input file httpwwwmediafirecomfilew1brfyxw93ywv1aArchivezip

input file:

http://www.mediafire.com/file/w1brfyxw93ywv1a/Archive.zip

UAEU College of Information UANEU Technology United Arab Emirates University ISEC 323 Secure Software Design and Engineering SECB 408 Mobile Secure Code Fall 2016 Group Project, Part 2 Total points S5 Due Thu Dec 8th, 2016 Teams of max 3 students The purpose of the project is to achieve a deeper understanding and hands-on experience with a prominent OS security issue: weak passwords. 1. Introduction To crack a password, a hacker must have access to the password database (off course, encrypted). After obtaining the databases, he has several options: A) Apply a Dictionary Attack: 1) Build a dictionary of common passwords 2) Writing the main crack routine, which tries each dictionary password with the database 3) Output the result of the hack (i.e., found or failed) B) Apply a Brute-force Attack: 1) Writing the main crack routine, which tries randomly generated password with the database 2) Output the result of the hack (i.e., found or failed) C) Combine A+B 1) i, e, combine dictionary with brute-force 2. inputs 1) a password database (password.txt), where the passwords are encrypted with \"RIPEMD160\". There are 100 usernames and passwords. Each username password is printed in this format: username password hash where username is the username and password-hash is the password hashed using the ripemd160 algorithm. 2) The dictionary of passwords (cain.txt), which contains 306,706 password list.

Solution

A settled finite automaton M may be a 5-tuple, (Q, , , q0, F), consisting of

a finite set of states (Q)
a finite set of input symbols referred to as the alphabet ()
a transition operate ( : letter of the alphabet × Q)
an initial or begin state (q0 Q)
a set of settle for states (F Q)
Let w = a1a2 ... Associate in Nursing be a string over the alphabet . The automaton M accepts the string w if a sequence of states, r0,r1, ..., rn, exists in letter of the alphabet with the subsequent conditions:

r0 = q0
ri+1 = (ri, ai+1), for i = 0, ..., n1
rn F.
In words, the primary condition says that the machine begins within the start state q0. The second condition says that given every character of string w, the machine can transition from state to state in keeping with the transition operate . The last condition says that the machine accepts w if the last input of w causes the machine to halt in one in all the acceptive states. Otherwise, it\'s same that the automaton rejects the string. The set of strings that M accepts is that the language recognized by M and this language is denoted by L(M).

A settled finite automaton while not settle for states and while not a beginning state is understood as a transition system or semiautomaton.

For a lot of comprehensive introduction of the formal definition see automata theory.