Commit graph

5 commits

Author SHA1 Message Date
agc
5293710fb4 Add SHA512 digests for distfiles for security category
Problems found locating distfiles:
	Package f-prot-antivirus6-fs-bin: missing distfile fp-NetBSD.x86.32-fs-6.2.3.tar.gz
	Package f-prot-antivirus6-ws-bin: missing distfile fp-NetBSD.x86.32-ws-6.2.3.tar.gz
	Package libidea: missing distfile libidea-0.8.2b.tar.gz
	Package openssh: missing distfile openssh-7.1p1-hpn-20150822.diff.bz2
	Package uvscan: missing distfile vlp4510e.tar.Z

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.
2015-11-04 01:17:40 +00:00
joerg
81775e6ac4 Explicitly include sys/vmmeter.h on NetBSD now. 2013-01-11 00:06:21 +00:00
dholland
ba8f298d38 regen distinfo (hi joerg!) 2011-11-26 13:31:58 +00:00
joerg
681afdef37 Fix build on DragonFly. From PR 38835.
Add DESTDIR support.
2008-09-17 16:15:54 +00:00
adrianp
4bd9b042d9 Import rainbowcrack from pkgsrc-wip, packaged by David Howland
RainbowCrack is a general propose implementation of Philippe Oechslin's faster
time-memory trade-off technique.  In short, the RainbowCrack tool is a hash
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.
2006-10-21 07:47:25 +00:00