# Mpus: Brute-Force Algorithm. Group Name: Mpus. Members:

1001 WordsFeb 28, 20175 Pages

MPUS: Brute-Force Algorithm
Group Name: MPUS
Members: Johann Redhead, Tellon Smith, Kevin Lord
I Johann Redhead…………………, Tellon Smith…………………, and Kevin Lord…………………, agree to attempt and solve the proposed problem to the best of our abilities.
Proposed Problem: Brute-force Algorithm
SUMMARY
Brute force is defined as very strong or forceful. In computer Science, this is essentially the same definition. Brute-force in Computer Science is the trial and error method used by application programs to decode encrypted data such as passwords or Data Encryption Standard (DES) keys, through exhaustive effort (using brute force) rather than employing intellectual strategies. This brute force method involves an attacker systematically*…show more content…* It is possible to design the algorithm both sequentially and in parallel.
During this project, we will solve the problem using both parallel and sequential methods. A performance analysis will be carried out on both methods to determine the efficiency and speed of each. The sequential algorithm will be written in both pseudo-code and the C++ language. The parallel method will also be written in pseudo-code but we will be using C and MPI instructions to achieve the parallelism of the operation. We would be using the Midwestern State University Turing cluster and personal Ubuntu virtual machines to implement both the parallel program and the sequential program. We as a group decided to pursue this topic as passwords play a vital part in how the world’s information is secured and verified. Passwords are used for user authentication to prove identity or access approval to gain access to a resource. Passwords remain the single most common point of failure in system security. Ensuring that passwords cannot be efficiently broken is important for encryption algorithms. Due to this, we decided to design a sequential and parallel algorithm that would be successful in cracking a password. Given an opportunity to research any topic where parallel programming may prove useful, we agreed on a brute-force algorithm. In our upcoming project, we would all attempt to design, implement, and analyze the brute-force algorithm.
STRATEGY
The sequential