summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'app-crypt/rainbowcrack')
-rw-r--r--app-crypt/rainbowcrack/metadata.xml26
1 files changed, 13 insertions, 13 deletions
diff --git a/app-crypt/rainbowcrack/metadata.xml b/app-crypt/rainbowcrack/metadata.xml
index 861e967436b6..dba1a3e1b1d7 100644
--- a/app-crypt/rainbowcrack/metadata.xml
+++ b/app-crypt/rainbowcrack/metadata.xml
@@ -1,17 +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>
+ <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>