diff options
| author | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
|---|---|---|
| committer | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
| commit | 4f2d7949f03e1c198bc888f2d05f421d35c57e21 (patch) | |
| tree | ba5f07bf3f9d22d82e54a462313f5d244036c768 /app-crypt/rainbowcrack/metadata.xml | |
reinit the tree, so we can have metadata
Diffstat (limited to 'app-crypt/rainbowcrack/metadata.xml')
| -rw-r--r-- | app-crypt/rainbowcrack/metadata.xml | 17 |
1 files changed, 17 insertions, 0 deletions
diff --git a/app-crypt/rainbowcrack/metadata.xml b/app-crypt/rainbowcrack/metadata.xml new file mode 100644 index 000000000000..861e967436b6 --- /dev/null +++ b/app-crypt/rainbowcrack/metadata.xml @@ -0,0 +1,17 @@ +<?xml version="1.0" encoding="UTF-8"?> +<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> +<pkgmetadata> +<maintainer type="project"> + <email>crypto@gentoo.org</email> + <name>Crypto</name> +</maintainer> +<longdescription> +RainbowCrack is a general propose implementation of Philippe Oechslin's faster time-memory trade-off technique. + In short, the RainbowCrack tool is a password cracker. A traditional brute force cracker try all possible +plaintexts one by one in cracking time. It is time consuming to break complex password in this way. The idea of +time-memory trade-off is to do all cracking time computation in advance and store the result in files so called +"rainbow table". It does take a long time to precompute the tables. But once the one time precomputation is +finished, a time-memory trade-off cracker can be hundreds of times faster than a brute force cracker, with the +help of precomputed tables. +</longdescription> +</pkgmetadata> |