<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Review of Top Open Source Password Cracking Tools</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Victor Legbo Yisa</string-name>
          <email>victor.yisa@futminna.edu.ng</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Meshach Baba</string-name>
          <email>babameshach01@futminna.edu.ng</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emmanuel Tosin Olaniyi</string-name>
          <email>olaniyi.emmanuel@st.futminna.edu.ng</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Cyber security Science, Federal University of Technology</institution>
          ,
          <addr-line>Minna</addr-line>
          ,
          <country country="NG">Nigeria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Federal University of Technology</institution>
          ,
          <addr-line>Minna</addr-line>
          ,
          <country country="NG">Nigeria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>134</fpage>
      <lpage>138</lpage>
      <abstract>
        <p>-Password authentication is one of the most common forms of authentication, verification and access control mechanism; Passwords remain the standard way to enhance the security of confidential information. Password cracking has become a salient part of penetration testing; white hat hackers will make use of password cracking tools to try to break into confidential information in order to test the strength. This write up review the most common forms of password cracking tools that can be used by penetration testers, the different methods of password cracking and ways passwords could be made more difficult to crack.</p>
      </abstract>
      <kwd-group>
        <kwd>-component</kwd>
        <kwd>cracking</kwd>
        <kwd>attack</kwd>
        <kwd>open source</kwd>
        <kwd>hashes</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>INTRODUCTION</p>
      <p>Passwords, as a form of authentication can be said to be
as old as time. In ancient times, watchmen would test those
wishing to enter an area or approaching it to supply a
watchword of which if correct entrance is given. In modern
times however, a combination of username and password is a
common means of authentication during log in processes.</p>
      <p>
        User authentication, as defined by RFC 2828 is “the
method of confirming an identity claimed by or for a system
entity” [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Basically, the verification process is divided into four main
categories: something known by user (knowledge factor)
(e.g. password, PIN, answers to given questions), something
the user owns (Ownership factor) (tokens, e.g. smart cards,
electronic keycards, physical key), something that the
individual is (Identity elements) (static biometrics, such as
fingerprints, retina, face), and something the individual does
(dynamic biometrics such as voice patterns, mouse
movement pattern, handwriting, typing rhythm) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Something the individual is and something the individual
does can be categorized under inherent factors. The most
common of the different authentication methods used now is
the password authentication (something the individual
knows) and has been commonly used as the line of defense
against intruders [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Password-based authentication works by comparing the
credentials provided by a user with stored secrets. Because
unauthorized users may have access to stored passwords,
there is a need that passwords be encrypted during storage
using cryptographic hash functions.</p>
      <p>
        Password cracking can be defined as the recovery of
plain password texts from a stored location which is usually
encrypted. Password cracking is the process of obtaining the
plaintext passwords from the stored encrypted secret, or at
least an equivalent one [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Generally, password cracking in
the hacking world ranges from decrypting password hashes
stolen from a database to even hacking wireless networks.
      </p>
      <p>This paper is organized as follows: section 2 will focus
on the forms of password authentication while Section 3 will
survey some password cracking techniques, Section 4
reviews the top password cracking tools and Section 5 shows
the conclusion, followed by an appendix of abbreviations
and available software.</p>
      <p>II.</p>
      <p>FORMS OF PASSWORD AUTHENTICATION</p>
      <p>There are various types of password-based authentication
and each of them has their strengths and weaknesses when
viewed in the area of memorability, usability and security.
Despite the somewhat recurring idea in Computer Security
that “the password is dead” and is therefore not
recommended, it is still in use and will continue to be, at
least for now. Some of these forms are discussed below:</p>
    </sec>
    <sec id="sec-2">
      <title>A. Alphabetic Password</title>
      <p>
        This is a type of password that entails the use of
alphabetic characters only and could be either a dictionary
word or not. An alphabetic password is very easy to
remember by the users, which makes it relatively easy to be
cracked either by a combination of social engineering and
guessing or dictionary attack. A list of the most commonly
used password types published by Google in 2013 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], shows
that this passwords were easy to guess and crack:
 Names within the house such as pet name, a close
family members name or friend‟s name.
 Name of Birthplace or favorite holiday place.
 Names or things that is associated to their favorite
sports club.
      </p>
      <p> The term “password" is also common.</p>
    </sec>
    <sec id="sec-3">
      <title>B. Alphanumeric Password</title>
      <p>This is a combination of alphabets and numbers in
forming a password, it is the most common approach for
authentication.</p>
      <p>Although more secured than alphabetic passwords,
alphanumeric passwords have its security and usability
problems, one of which is the easy-to-guess substitutions
such as 'A' for '4', 'S' for '5', 'E' for '3' and 'I' for „1',
substitutions which attackers are conversant with. Another
drawback of the alphanumeric password is the difficulty of
recalling the alphanumeric password by the user at the point
of log in, especially if it is not frequently used or written
down.</p>
    </sec>
    <sec id="sec-4">
      <title>C. Graphical Password</title>
      <p>
        Greg Blonder (1996) described graphical passwords [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
as involving the display of a predetermined graphical image
and necessitating the user to select particular areas of the
image in a particular order. The graphical password is a
nontext based password, an alternative means of authentication
intended for use in lieu of the conventional text-based
passwords. Contrary to the memorability issues of
alphanumeric passwords, graphical passwords are more
memorable [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], and the relative ease or ability of humans to
recognize faces and points within pictures has given it better
usability when compared with other forms of password
authentication, leading to imitations by machines with
varying degree of success [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Graphical passwords, unlike
the conventional alphanumeric password can be said to be
even more secured as users do not have to write it down,
making it less susceptible to social engineering attack.
      </p>
      <p>
        In a 2010 study [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], Agarwal et al. compared
alphanumeric passwords and graphical passwords in terms of
memorability. They explained that in remembering
passwords, password was inputted three times by each user
in each trial, each user is only allowed to input correct
password once; table 1 below shows the number of incorrect
password submission.
      </p>
      <p>In the analysis of memorability, MatLab was used and it
can be seen that for the memorability factor (R1/R2/R3) and
mode (alphanumeric/graphical), it was discovered that
graphical password was always favored from the incorrect
submission calculation. In a second experiment that
compared the time for correct submission, a factor that can
influence productivity, table 2 below shows that it took
graphical password lesser time to summit correct when
compared with alphanumeric password.</p>
      <p>
        From table 1 and 2 above, it can be concluded that
graphical password is more memorable when compared with
alphanumeric password, which means it is generally more
usable. However balancing usability and security seems to be
almost impossible as researches on security and usability
mostly support the notion that a system cannot be both
usable and secured, but can only be one of them at a time
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        Better memorability is the major advantage of graphical
password over alphanumeric password, But, a major
disadvantage is the fact that they are highly susceptible to
shoulder-surfing [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>A pivotal question that seems to be unanswered is: Is it
possible to have a secured and usable authentication system?
To be precise, does a secured, memorable and usable
authentication technique for information security exist? Most
probably the answer would be “maybe”.</p>
      <p>
        As it concerns the security, memorability and usability of
password authentications, a few pointers are as follows:
 Avoid using any word as password from any
dictionary.
 All good Passwords should contain special character,
letters, and number and should not be less than eight
characters long.
 Apply the pass-phrase approach in password
generation i.e. for a phrase like “My much secured
password is longer than 8 characters” the generated
password would be “Mmspilt8c”. This approach
reduces the burden of memorability [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>III.</p>
      <p>PASSWORD CRACKING TECHNIQUES</p>
      <p>Password cracking tools can be majorly categorized into
offline and online cracking categories.</p>
      <p>Attacks such as dictionary and brute-force attack
performed against on a live system login form or session is
called online attack</p>
      <p>
        The prevalence of online attacks may not be as much as
offline attacks due to the fact that they are mostly impossible
to pull off as there are numerous protection schemes in use
that can make this kind of attack difficult and dangerous to
realize but it is still possible to pull off if some of these
mechanisms such as maximum unsuccessful authentication
attempts and Captcha images can be evaded [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>Offline attacks are carried after a password databases has
been copied, or sniffed from an encrypted connection, offline
do not alert the victim. This type of attack is popular as it is
often easier to pull through as there are usually numerous
possible vulnerabilities that can allow its exploit.</p>
      <p>
        Dictionary Attack: Dictionary attack is a technique for
exploiting a hashed authentication mechanism by trying to
determine its decryption key by repeatedly trying thousands
or millions of likely possibilities, such as words in a
dictionary. In dictionary attack, wordlist comprising of
possible and likely passwords is used by the cracker in
attempting to gain access to a system [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] although wordlist
that have proven to be the most successful in time past are
composed of various public sources or databases filtered
previously captured from real password [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. There are
several wordlists that are available, for Kali Linux users,
there is a wordlist in the directory “usr/share/wordlists”, with
“rockyou.txt.gz” being the popular of all, and it can be
unzipped and padded with more custom passwords or known
weak passwords. While some are available for free, some are
not, as they seem to contain even more language
combinations than the free ones.
Brute-Force Attack: This type of attack, also known as
exhaustive search involves the attacker trying every possible
combination with the hope of eventually guessing correctly,
it can be fast when used to check short passwords.
Theoretically, a brute-force attack is a cryptanalytic attack
that tries to decrypt all encoded data [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] (with the exception
of the data encrypted in a secured-information theory).
      </p>
      <p>
        The method involves computing the hash of the given
password one by one, and then comparing the result of each
hash with the target hash stored on the database. The
drawback to this method is that the longer the password the
longer the time to find the right password thereby consuming
lots of system resources. Also, the computed hash cannot be
reused to crack another password [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        Hybrid Attack: This is a combination of both dictionary
attack and brute-force attack, whereby the dictionary
includes the wordlist and the brute-force is applied to each
possible password in the list by taking each entry in the
dictionary and creating a few variation of the dictionary
word (like adding a prefix or suffix of numbers) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] . A
Hybrid attack will also exponentially increase the
computation and time depending on the amount of characters
to be concatenated with the Dictionary entries [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Rainbow Tables: Hellman in 1980 introduced the
timememory-trade-off method used in reducing the time that is
needed in cracking a cryptographic system [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and was
based on the fact that exhaustive search requires a lot of time
or computing power to succeed.
      </p>
      <p>
        Because of the drawback experienced in the Hellman
time-memory-tradeoff Oechslin suggested what he termed
rainbow tables (a time-memory-tradeoff technique) which
drastically reduced the number of collisions experienced in
the Hellman‟s model thereby reducing the number of
calculations [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. This is done by a pre-computation of the
password hashes thereby reducing the time taking to crack a
password. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        Rainbow Tables are faster than brute force attacks once
the hash tables have been created, since the time it takes to
compute the hash has been eliminated but it makes use of
large storage area [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Another drawback of rainbow table is
that it takes a lots of time to compute the rainbow table
yourself.
      </p>
      <p>IV.</p>
      <p>PASSWORD CRACKING TOOLS</p>
    </sec>
    <sec id="sec-5">
      <title>A. Ophcrack</title>
      <p></p>
      <p>It is an open source program that decodes Windows
logon password through rainbow tables by using LM hashes;
it can also import the hashes from a variety of formats and
sources even by directly dumping hashes from the SAM files
of Windows. Most rainbow tables for LM Hashes are usually
provided for free by the developers, although there are paid
rainbow tables which tend to contain more hashes than the
free counterpart. According to OPH Reviews, Ophcrack is
fast and easy enough for a first-time password cracker user
with basic Windows knowledge and it can crack most
passwords within a few minutes, on most computers.”
Features
</p>
      <p>Can be used on the most popular Operating systems
including Windows, Linux/Unix and Mac OS X
Can be used to breack LM and NTLM hashes</p>
      <p>Free tables available for Windows XP, Vista, 7, 8.1
Brute-force module for simple passwords
Audit mode and CSV Exports
Analysis of passwords using real-time graphs.</p>
      <p>Live CD available
Dumps and loads hashes from SAM encryption
recovered from a Windows partition</p>
      <p>Its free and available for download</p>
    </sec>
    <sec id="sec-6">
      <title>B. Rainbow Crack</title>
      <p>
        Rainbow crack is a computer program that creates a
rainbow tables for use in cracking the password; it works for
general use by Philippe Oechslin faster time-memory
tradeoff technology [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]; and uses memory trade-off algorithm to
crack hashes from the pre-computation of “rainbow tables”.
Well, it is time-consuming in pre-computing the tables but is
considerably hundreds of time faster than a brute-force
cracker once the pre-calculation is done. The only drawback
noticed is that OS X is not supported.
      </p>
      <p> Time-memory tradeoff tool suites, including the
production, sorting, conversion and lookup of
rainbow tables.
 It is compatible with any rainbow table hash
algorithm
 It is compatible with rainbow table of any character
set, raw file format (.rt) and compact file format
(.rtc)
 It supports computing on multi-core processor.
 GPU acceleration with NVidia GPUs and AMD</p>
      <p>GPUs (CUDA Technology)
 GPU acceleration on multiple CPUs
 Can run on both windows and linux operating
systems
 Has both graphical interface as well as command
line interface
 It has a merged rainbow table file format on all
compatible operating systems</p>
    </sec>
    <sec id="sec-7">
      <title>C. Hashcat</title>
      <p>


</p>
      <p>
        Hashcat is the self-proclaimed world‟s fastest CPU-based
password recovery and cracking tool tool; although not as
fast as its GPU counterpart oclHashcat, this seems to be the
case as Fossbytes agrees. Hashcat can break 92672M h/s of
hashes with the measurement made in hashes per second[
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
There are available versions for popular operating systems:
Linux, OS X and Windows and can come in either
CPUbased or GPU-based variants. Its free for use and features
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
      </p>
      <p>




</p>
      <sec id="sec-7-1">
        <title>It is free for use</title>
        <p>Uses multiple GPU (up to 128gpus)
Supports multiple Hash (up to 100 million hashes)
Can be used on multiple Operating Systems
Multi-Platform (OpenCL and CUDA support)
Supports sessions, hex-salt, hex-charset, distributed
cracking etc.</p>
        <p>Over 150 algorithms implemented with performance
in mind
Focused Dictionary based attacks
Low resource utilization
Built-in benchmarking system




</p>
        <p>
          Integrated thermal watchdog and attack modes
include [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]
Straight and combination attack
Brute-force
Hybrid dictionary + mask
        </p>
        <p>Hybrid mask + dictionary
D. Cain and Abel</p>
        <p>
          Cain &amp; Abel is a password recovery tool for Windows
OS that can be used by sniffing the network, deciphering
encoded passwords using Dictionary, Brute-force and
Cryptanalysis attacks, recording VoIP conversations,
decoding scrambled passwords for the recycling of various
types of passwords. It also helps recovering wireless network
keys, revealing password boxes, cached password detection
and analysis of routing protocols [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. It is the ultimate
MITM utility but is only available for Windows OS and can
be a little complicated for novice users [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Its features
include:


        </p>
      </sec>
      <sec id="sec-7-2">
        <title>Used for WEP cracking. Speeding up packet capture sped by wireless packet injection. Traceroute.</title>
        <p>ARP Spoofing
Facility to record VoIP conversation
Can be used to sniff Network Password
It has IP to MAC addresses resolution facility
It can crack diverse forms of hashes including but
not limited to LM and NT hashes, IOS and PIX
hashes, RADIUS hashes, RDP passwords, MD2,
MD4, MD5, SHA-1, SHA-2, RIPEMD-160,
Kerberos 5, MSSQL, MySQL, Oracle and SIP
hashes.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>E. John the Ripper</title>
      <p>
        Originally developed by UNIX, John the ripper is a free
software cracking tool to detect weak password and is now
available for many flavors of UNIX, Windows, DOS and
OpenVMS. It is one popular password testing and fracture
program that combine a range of password crackers in a
package that automatically detects types of password hash
and can run against various encryptions [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] . While it is not
designed specifically to crack strong passwords, it
implements a brute-force strategy and brute-force as we
know it, is considered infallible but can be time consuming
and computationally expensive [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p> Supports Dictionary and Brute-force attacks
 Multiplatform
 Its available for free</p>
    </sec>
    <sec id="sec-9">
      <title>F. THC Hydra</title>
      <p>The THC Hydra is a very fast and flexible network logon
cracker which primarily employs a brute-force
dictionarybased attack. Hydra supports a wide range of network
protocols including but not limited to TELNET, FTP, HTTP,
HTTPS, SNMP, IMAP, POP3, etc. It provides a Command
Line Interface and a Graphical User Interface. Its features
include
 Available for Windows, Linux and OS X
 It is extensible and easy to add new modules

</p>
      <p>Very effective against remote authentication
services.</p>
      <p>Can perform rapid dictionary attacks against more
than 30 protocols.</p>
      <p>Supportive with Brute-force and Dictionary attacks</p>
    </sec>
    <sec id="sec-10">
      <title>G. L0phtCrack</title>
      <p>Is a different flavour of OphCrack that tries to crack
Windows password from hashes by using Windows
workstations, network servers, primary domain controllers
and Active Directory for cracking passwords; using
dictionary and brute-force attack to generate and guess
passwords.</p>
      <p>Lophtcrack has the following features and abilities
 Extraction of hashes from Windows versions,
multiprocessor algorithms, and networks monitoring
and decoding.
 It runs On most BSD and Linux variants with an</p>
      <p>SSH daemon.
 Can run on windows XP and higher operating
system, runs on windows server 2003 and 2008 and
in both 32 and 64 bit environments
 Can remotely retrieve passwords
 Can perform scheduled scans
 Scoring of passwords
 Supports pre-calculated dictionary wordlist
 Supports Unix &amp; Windows password
 Executive Level Reporting
 Can give information on the risk status of</p>
      <p>Passwords
 Password Audit Method</p>
      <p>Despite the fact that passwords are encrypted before
storing them, the tools above can still be used in cracking or
revealing the password. Although this tools are mostly
effective against password that are just encrypted and stored.
These tools will be less effective against systems that employ
the techniques below to strengthen the password.</p>
    </sec>
    <sec id="sec-11">
      <title>A. Salting</title>
      <p>
        This involves adding some bits of information known as
salt to a password before they are hashed [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], making it
unguessable or more difficult for a standard rainbow table to
crack [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. When two salts are used, it becomes harder to
crack the password [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. The use of salts will prevent the use
of rainbow tables in order to break password hashes.
Although it is easy to implement and straight forward, it is
also important to salt passwords in a proper and orderly
manner. For example for every password or user, a different
salt should be created so that a rainbow table will not be
created for the set of passwords. Also a large salt value will
be more preferable to smaller ones and salt values should be
randomly generated [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ].
      </p>
    </sec>
    <sec id="sec-12">
      <title>B. Strong password</title>
      <p>The use of passwords that contains both capital and small
letters, numbers and special characters and a total of at least
8 characters or more can affect the effectiveness or greatly
increase the time it takes to crack this types of password.</p>
    </sec>
    <sec id="sec-13">
      <title>Hybridized Authentication</title>
      <p>Password form of authentication can be combined with
other forms of authentication such as biometric, tokens or
cards, thereby making these cracking tools less effective in
password cracking</p>
      <p>CONCLUSION</p>
      <p>Password authentication remains the mostly used method
of verification; however there are several vulnerabilities in
its use (such as password reuse, dictionary words etc.) and
several classes of attacks against passwords. These
vulnerabilities can easily be exploited by password cracking
tools. Most of these password cracking tools are available for
free or in open source licenses. Based on the cracking task, a
penetration tester may adopt any of these cracking tools as
suitable (based on the tools features and characteristics) to
carry out his pen testing task. An ethical hacker and
penetration tester can pick from any of this open source
cracking tools for pure authorized cracking purposes and it is
strongly advice that these tools be used for learning
purposes.</p>
      <p>Password</p>
      <p>[Online].</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shirey</surname>
          </string-name>
          ,
          <article-title>"RFC 2828: Internet Security Glossary,"</article-title>
          <source>The internet Society 13</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. L.F</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Wong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Chao</surname>
          </string-name>
          ,
          <article-title>"Password Cracking and Countermeasures in Computer Security: A Survey,"</article-title>
          <source>arXiv preprint arXiv:1411</source>
          .
          <fpage>7803</fpage>
          .,
          <string-name>
            <surname>November</surname>
          </string-name>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Dasgupta</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <article-title>"A biologically inspired password authentication system,"</article-title>
          <source>in CSIIRW '09 Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies</source>
          , New york,
          <year>2009</year>
          , p.
          <fpage>41</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Seeley</surname>
          </string-name>
          ,
          <article-title>"Password cracking: A game of wits,"</article-title>
          <source>in Communications of the ACM 32.6</source>
          ,
          <issue>1989</issue>
          , pp.
          <fpage>700</fpage>
          -
          <lpage>703</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Marechal</surname>
          </string-name>
          ,
          <article-title>"Advances in password cracking</article-title>
          .,
          <source>" Journal in computer virology</source>
          , vol.
          <volume>4</volume>
          , no.
          <issue>1</issue>
          , 2008 pp.
          <fpage>73</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6] Techlicious / Fox Van Allen @
          <source>techlicious (2013-08-08)</source>
          .
          <article-title>"Google Reveals the 10 Worst Password Ideas | TIME.com"</article-title>
          .
          <source>Techland.time.com. Retrieved</source>
          <year>2016</year>
          -
          <volume>10</volume>
          -19
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.E.</given-names>
            <surname>Blonder</surname>
          </string-name>
          , . U.S. Patent No.
          <volume>5</volume>
          ,
          <issue>559</issue>
          ,
          <fpage>951</fpage>
          . Washington, DC: U.S. Patent and
          <string-name>
            <given-names>Trademark</given-names>
            <surname>Office</surname>
          </string-name>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,.and
          <string-name>
            <given-names>R.S.</given-names>
            <surname>Shukla</surname>
          </string-name>
          ,.
          <article-title>Security Analysis of Graphical Passwords over the Alphanumeric Passwords</article-title>
          .
          <source>Int. J. Pure Appl. Sci. Technol</source>
          .
          <volume>1</volume>
          (
          <issue>2</issue>
          ),
          <year>2010</year>
          ,pp
          <fpage>60</fpage>
          -
          <lpage>66</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Chellappa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Wilson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Sirohey</surname>
          </string-name>
          ,
          <article-title>"Human and Machine Recognition of Faces: A Survey,"</article-title>
          <source>Proceedings of the IEEE</source>
          , vol.
          <volume>83</volume>
          ,
          <year>1995</year>
          , pp.
          <fpage>705</fpage>
          -
          <lpage>741</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L. F.</given-names>
            <surname>Cranor</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Garfinkel</surname>
          </string-name>
          ,
          <article-title>"Secure or Usable?,"</article-title>
          <source>IEEE Privacy &amp; Security</source>
          , vol.
          <volume>2</volume>
          ,
          <issue>2004</issue>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>18</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>F.</given-names>
            <surname>Tari</surname>
          </string-name>
          ,,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ozok</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.H.</given-names>
            <surname>Holden</surname>
          </string-name>
          , .
          <article-title>A comparison of perceived and real shoulder-surfing risks between alphanumeric and graphical passwords</article-title>
          .
          <source>In Proceedings of the second symposium on Usable privacy and security</source>
          <year>2006</year>
          , pp.
          <fpage>56</fpage>
          -
          <lpage>66</lpage>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Blackwell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Grant</surname>
          </string-name>
          ,
          <article-title>"Password Memorability and Security: Empirical Results,"</article-title>
          <source>IEEE Privacy &amp; Security</source>
          , vol.
          <volume>2</volume>
          ,
          <issue>2004</issue>
          , pp.
          <fpage>25</fpage>
          -
          <lpage>31</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Yiannis</surname>
          </string-name>
          ,
          <article-title>"Modern Password Cracking: A hands-on approach to creating an optimised and versatile attack</article-title>
          .,
          <source>"</source>
          <string-name>
            <surname>Surrey</surname>
            ,
            <given-names>Thesis</given-names>
          </string-name>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Y.S.</given-names>
            <surname>Dandass</surname>
          </string-name>
          , ,
          <article-title>"Using FPGAs to parallelize dictionary attacks for password cracking,"</article-title>
          <source>in Hawaii International Conference on System Sciences, Proceedings of the 41st Annual, Hawai</source>
          ,
          <year>2008</year>
          , pp.
          <fpage>485</fpage>
          -
          <lpage>485</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Paar</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Jan</surname>
          </string-name>
          ,
          <article-title>Understanding cryptography: a textbook for students and practitioners</article-title>
          .: Springer Science &amp; Business
          <string-name>
            <surname>Media</surname>
          </string-name>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kumar</surname>
          </string-name>
          et al.,
          <article-title>"Rainbow table to crack password using MD5 hashing algorithm,"</article-title>
          <source>in IEEE Conference Publishing School of Information Technology and Engineering</source>
          (SITE) VIT University, Vellore, India,
          <source>JeJu Island</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>433</fpage>
          -
          <lpage>439</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <article-title>nFront security</article-title>
          . (
          <year>2011</year>
          )
          <article-title>Everything Administrators need to know about Windows password security</article-title>
          . [Online] http://nfrontsecurity.com/downloads/nFront-Security
          <string-name>
            <surname>-WhitepaperEverything-You-Need-To-Know-About</surname>
          </string-name>
          Password-Security.pdf
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hellman</surname>
          </string-name>
          ,
          <article-title>"A cryptanalytic time-memory trade-off,"</article-title>
          <source>IEEE Transactions on Information Theory</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>401</fpage>
          -
          <lpage>406</lpage>
          ,
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>P.</given-names>
            <surname>Oechslin</surname>
          </string-name>
          ,
          <article-title>"Making a faster cryptanalytic time-memory trade-off," in Annual International Cryptology Conference</article-title>
          ., Berlin,
          <year>2003</year>
          , pp.
          <fpage>617</fpage>
          -
          <lpage>630</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Chester</surname>
          </string-name>
          ,.,
          <source>"Analysis of Password Cracking Methods &amp; Applications"</source>
          (
          <year>2015</year>
          ).
          <source>Honors Research Projects. Paper</source>
          <volume>7</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Hashcat</surname>
          </string-name>
          . Advanced https://hashcat.net/hashcat/
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>A. E. .Mohamed.</surname>
          </string-name>
          (
          <year>2013</year>
          ,
          <article-title>January) Password Cracking Using Cain &amp; Abel</article-title>
          . [Online]. http://resources.infosecinstitute.
          <article-title>com/passwordcracking-using-cain-abel/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>S.</given-names>
            <surname>Fahmy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Akhyari</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Shamsuddin</surname>
          </string-name>
          ,
          <article-title>"Wireless network attack: Raising the awareness of Kampung WiFi residents,"</article-title>
          <source>in Computer &amp; Information Science (ICCIS)</source>
          , 2012 International Conference on, vol.
          <volume>2</volume>
          ,
          <issue>2012</issue>
          , pp.
          <fpage>736</fpage>
          -
          <lpage>740</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>S Balasubramanian.</surname>
          </string-name>
          (
          <year>2010</year>
          , July) Techulator. [Online]. http://www.techulator.com/reviews/133-John-The Ripper.aspx
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>R.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <article-title>"Parallelization of John the Ripper (JtR) using MPI,"</article-title>
          University of Nebraska, Nebraska,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mark</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            <surname>Lomas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Needham</surname>
          </string-name>
          ,
          <article-title>"Strengthening passwords," d i g i t a l Systems Research Center</article-title>
          , Palo Alto, California,
          <source>Technical Note September</source>
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>B.</given-names>
            <surname>Groza</surname>
          </string-name>
          ,
          <article-title>"Analysis of a Password Strengthening Technique and Its Practical Use,"</article-title>
          <source>in 2009 Third International Conference on Emerging Security Information, Systems and Technologies</source>
          , Athens, Glyfada,
          <year>2009</year>
          , pp.
          <fpage>292</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>U.</given-names>
            <surname>Mamber</surname>
          </string-name>
          ,
          <article-title>"A simple scheme to make passwords based on one-way functions much harder to crack</article-title>
          .
          <source>Computers &amp; Security</source>
          ,
          <volume>15</volume>
          (
          <issue>2</issue>
          ),
          <fpage>171</fpage>
          -
          <lpage>176</lpage>
          .,
          <article-title>"</article-title>
          <source>Computers &amp; Security</source>
          , vol.
          <volume>15</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>171</fpage>
          -
          <lpage>176</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>K.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <article-title>"The Dangers of Weak Hashes," SANS Institute Infosec reading room</article-title>
          ,
          <source>GIAC GWEB Gold Certification November</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>