From: David Seifert Date: Sat, 25 Nov 2017 17:54:47 +0000 (+0100) Subject: app-crypt/rainbowcrack: [QA] Consistent whitespace in metadata.xml X-Git-Url: http://git.tremily.us/gitweb.cgi?a=commitdiff_plain;h=820735be04e5b7f99ba9d897dab50cfd14d78b14;p=gentoo.git app-crypt/rainbowcrack: [QA] Consistent whitespace in metadata.xml --- 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 @@ - - crypto@gentoo.org - Crypto - - -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. - + + crypto@gentoo.org + Crypto + + + 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. +