1
0
mirror of https://github.com/hashcat/hashcat.git synced 2024-11-05 06:58:56 +00:00
Go to file
2017-08-23 12:46:14 +02:00
charsets Order some of the new DES charset files 2017-07-04 09:50:07 +02:00
deps/OpenCL-Headers Fixed a hash validation error when trying to load Android FDE < 4.3 hashes 2017-03-21 14:07:16 +01:00
docs Added option --example-hashes to show an example hash for each hash-mode 2017-08-22 11:09:46 +02:00
extra/tab_completion Added option --example-hashes to show an example hash for each hash-mode 2017-08-22 11:09:46 +02:00
include Limit kernel-loops in straight-mode to 256, therefore allow rules to be stored in constant memory 2017-08-23 12:43:59 +02:00
masks
obj/lzma_sdk Vectorized 1Password, cloudkeychain and added support for long passwords 2017-07-06 14:11:33 +02:00
OpenCL Also switch optimized kernels rule engine to make use of kernel rules in constant memory 2017-08-23 12:46:14 +02:00
rules
src Limit kernel-loops in straight-mode to 256, therefore allow rules to be stored in constant memory 2017-08-23 12:43:59 +02:00
tools formatting: remove tabs in tools/package_bin.sh 2017-08-14 09:04:37 +02:00
.appveyor.yml Fix AppVeyor 2017-04-27 16:24:44 -07:00
.editorconfig
.gitattributes
.gitignore Ensure 'make clean' is a safe operation (eg. do not remove output and 2017-04-06 11:39:29 +02:00
.gitmodules
.travis.yml
BUILD.md cleanup git submodule command 2017-02-09 15:17:09 -08:00
example0.cmd
example0.hash
example0.sh Fix sed call in Makefile 2016-06-11 11:39:49 +02:00
example400.cmd
example400.hash
example400.sh
example500.cmd
example500.hash
example500.sh
example.dict
hashcat.hcstat2 LZMA compress version of hashcat.hcstat2 2017-06-23 14:37:45 +02:00
hashcat.hctune Limit kernel-loops in straight-mode to 256, therefore allow rules to be stored in constant memory 2017-08-23 12:43:59 +02:00
Makefile
README.md Fix README, update C standard 2017-06-10 14:50:03 +02:00

hashcat

hashcat is the world's fastest and most advanced password recovery utility, supporting five unique modes of attack for over 200 highly-optimized hashing algorithms. hashcat currently supports CPUs, GPUs, and other hardware accelerators on Linux, Windows, and OSX, and has facilities to help enable distributed password cracking.

License

hashcat is licensed under the MIT license. Refer to docs/license.txt for more information.

Installation

Download the latest release and unpack it in the desired location. Please remember to use 7z x when unpacking the archive from the command line to ensure full file paths remain intact.

Usage/Help

Please refer to the Hashcat Wiki and the output of --help for usage information and general help. A list of frequently asked questions may also be found here. The Hashcat Forums also contain a plethora of information.

Building

Refer to BUILD.md for instructions on how to build hashcat from source.

Tests:

Travis Appveyor Coverity
Hashcat Travis Build status Hashcat Appveyor Build status Coverity Scan Build Status

Contributing

Contributions are welcome and encouraged, provided your code is of sufficient quality. Before submitting a pull request, please ensure your code adheres to the following requirements:

  1. Licensed under MIT license, or dedicated to public domain (BSD, GPL, etc. code is incompatible)
  2. Adheres to gnu99 standard
  3. Compiles cleanly with no warnings when compiled with -W -Wall -std=gnu99
  4. Uses Allman-style code blocks & indentation
  5. Uses 2-spaces as indentation or a tab if it's required (for example: Makefiles)
  6. Uses lower-case function and variable names
  7. Avoids the use of ! and uses positive conditionals wherever possible (e.g., if (foo == 0) instead of if (!foo), and if (foo) instead of if (foo != 0))
  8. Use code like array[index + 0] if you also need to do array[index + 1], to keep it aligned

You can use GNU Indent to help assist you with the style requirements:

indent -st -bad -bap -sc -bl -bli0 -ncdw -nce -cli0 -cbi0 -pcs -cs -npsl -bs -nbc -bls -blf -lp -i2 -ts2 -nut -l1024 -nbbo -fca -lc1024 -fc1

Your pull request should fully describe the functionality you are adding/removing or the problem you are solving. Regardless of whether your patch modifies one line or one thousand lines, you must describe what has prompted and/or motivated the change.

Solve only one problem in each pull request. If you're fixing a bug and adding a new feature, you need to make two separate pull requests. If you're fixing three bugs, you need to make three separate pull requests. If you're adding four new features, you need to make four separate pull requests. So on, and so forth.

If your patch fixes a bug, please be sure there is an issue open for the bug before submitting a pull request. If your patch aims to improve performance or optimizes an algorithm, be sure to quantify your optimizations and document the trade-offs, and back up your claims with benchmarks and metrics.

In order to maintain the quality and integrity of the hashcat source tree, all pull requests must be reviewed and signed off by at least two board members before being merged. The project lead has the ultimate authority in deciding whether to accept or reject a pull request. Do not be discouraged if your pull request is rejected!

Happy Cracking!