|
|
Decryption and Password Cracking SoftwarePassword Recovery Toolkit® (PRTK®)  Locked out? Get back in. Password Recovery Toolkit gives you the ability to recover passwords from well-known applications. PRTK is perfect for law enforcement and corporate security professionals. If you need access to locked files or if your users have simply locked themselves out of their files, PRTK is The Key to Cracking It. VIEW PRODUCT DETAILS
Distributed Network Attack® (DNA®)  DNA is a new approach to recovering password protected files. In the past, recoveries have been limited to the processing power of one machine. DNA uses the power of machines across the network or across the world to decrypt passwords. The DNA Server is installed in a central location where machines running the DNA Client can access it over the network. DNA Manager coordinates the attack, assigning small portions of the key search to machines distributed throughout the network. The DNA Client will run in the background, only taking unused processor time. VIEW PRODUCT DETAILS
Supported File Formats:
System RequirementsAll RAM requirements are based on memory available after the OS is loaded. USB is required. PRTK™ Recommended Requirements
DNA® Supervisor Recommended Requirements
DNA® Worker Recommended Requirements
NOTE: Currently, only the English version of MS Windows platforms is being supported. Portable Office Rainbow Tables® (PORT®)  Rainbow Tables are pre-computed, brute-force attacks. In cryptography, a brute-force attack is an attempt to recover a cryptographic key or password by trying every possible combination until the correct one is found. How quickly this can be done depends on the size of the key, and the computing resources applied. A system set at 40-bit encryption has one trillion keys available. A brute-force attack of 500,000 keys per second would take approximately 25 days to exhaust the key space combinations using a single 3 Ghz Pentium 4 computer. With a Rainbow Table, you can decrypt 40-bit encrypted files in seconds or minutes rather than days or weeks. DNA and PRTK seamlessly integrate with Rainbow Tables. VIEW PRODUCT DETAILS >
Rainbow Tables® Rainbow Tables are pre-computed, brute-force attacks. In cryptography, a brute-force attack is an attempt to recover a cryptographic key or password by trying every possible combination until the correct one is found. How quickly this can be done depends on the size of the key, and the computing resources applied. A system set at 40-bit encryption has one trillion keys available. A brute-force attack of 500,000 keys per second would take approximately 25 days to exhaust the key space combinations using a single 3 Ghz Pentium 4 computer. With a Rainbow Table, you can decrypt 40-bit encrypted files in seconds or minutes rather than days or weeks. DNA and PRTK seamlessly integrate with Rainbow Tables. VIEW PRODUCT DETAILS MS OfficeMS Office 97 and 2000 derive a 40-bit encryption key from a user-supplied password. Our rainbow tables recover that 40-bit key in typically less than one minute. Once the key has been recovered, the document can be decrypted. Adobe PDFOlder PDF versions derive a 40-bit key from the user supplied password. Our rainbow tables recover that key, usually in less than a minute. Once the key has been recovered, the document can be decrypted. Again, the key, not the password, is recovered. Newer PDF versions use 128-bit keys and cannot be attacked with rainbow tables. Windows LAN HashThese rainbow tables are a little different than the others. First, they recover passwords, not keys. Second, the number of possible LAN passwords is much more than a trillion (the approximate size of a 40-bit key space), so it is not practical to generate a complete set of LAN rainbow tables. However, if we restrict the set of characters in the passwords to letters, numbers, and about 16 other symbols, then the rainbow tables covering these passwords fit in about the same space as the Office and PDF tables.
|
FTK Forensic Toolkit
