Abstract
A Password P, can be defined as a hash of x symbols .A brute force password cracking algorithm will go through every possible combination of symbols from 1 – x symbols. This form of password cracker takes O(n) time to solve, where n is the number of possible combinations, achieved by sn where s is the number of symbols available for a password. Having a password cracker with multiple processors, having the processors instead of all checking from symbol 0 to the last symbol, using a more decentralized approach can greatly improve the speed of this computation to O(n/2) for two processors, O(n/3) for three processors and O(n/np) as a generalized formula. This algorithm also allows for multiple processors of different clock speeds to also crack a password in more optimal time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
