skinc/apg
1
Fork 0
Code Releases 8 Activity

APG v2.1.0

Browse Source
This commit is contained in:
Adel I. Mirzazhanov
2002-09-13 15:10:49 +07:00
committed by skinc
parent 8087f2a5e4
commit 900ff5ea18
44 changed files with 2999 additions and 880 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
doc/man/apgbfm.1
View File

@@ -2,29 +2,29 @@
.\" Licensed under BSD-like License.
.\" Created by Adel I. Mirzazhanov
.\"
.TH APGBFM 1 "2001 Mar 18" "Automated Password Generator" "User Manual"
.TH APGBFM 1 "2002 Jun 12" "Automated Password Generator" "User Manual"
.SH NAME
apg
apgbfm
\- APG Bloom filter management program
.SH SYNOPSIS
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-n\fP \fBnumofwords\fP
\fB-f\fP \fIfilter\fP \fB-n\fP \fBnumofwords\fP [\fB-q\fP]
.br
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-d\fP \fIdictfile\fP
\fB-f\fP \fIfilter\fP \fB-d\fP \fIdictfile\fP [\fB-q\fP]
.br
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-a\fP \fBword\fP
\fB-f\fP \fIfilter\fP \fB-a\fP \fBword\fP [\fB-q\fP]
.br
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-A\fP \fIdictfile\fP
\fB-f\fP \fIfilter\fP \fB-A\fP \fIdictfile\fP [\fB-q\fP]
.br
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-c\fP \fBword\fP
\fB-f\fP \fIfilter\fP \fB-c\fP \fBword\fP [\fB-q\fP]
.br
.B apgbfm
\fB-f\fP \fIfilter\fP \fB-C\fP \fIdictfile\fP
\fB-f\fP \fIfilter\fP \fB-C\fP \fIdictfile\fP [\fB-q\fP]
.br
.B apgbfm
[\fB-v\fP] [\fB-h\fP]
@@ -50,7 +50,7 @@ In simple words, \fBapgbfm\fP generates \fIn\fP hash values for every word and
sets corresponding bits in filter file to 1. To check the word \fBapgbfm\fP
generates the same hash functions for that word and if all \fIn\fP corresponding
bits in filter file are set to 1 then it suppose that word exists in dicionary.
\fBapgbfm\fP uses \fBmd5\fP as a hash function.
\fBapgbfm\fP uses \fBSHA-1\fP as a hash function.
.PP
\fBapgbfm\fP can be used as standalone utility, not only with \fBapg\fP, or
\fBapgd\fP.
@@ -73,14 +73,21 @@ want to fill filter dynamicaly.
.TP
.B -d \fIdictfile\fP
create new filter from \fIdictfile\fP. It may take a lot of time to
generate filter from a big dictionary. To indicate that program is working
\fBapgbfm\fP prints dot for every 100 words added in dictionary.
generate filter from a big dictionary. In that dictionary you may place
words (one per line) that should not appear as generated passwords.
For example: user names common words, etc. You even can use one of the
dictionaries that come with \fIdictionary password crackers\fP.
This check is case sensitive. For example, if you want to reject word 'root',
you should insert in \fIdictfile\fP words: root, Root, RoOt, ... , ROOT.
To indicate that program is working \fBapgbfm\fP prints dot for every 100
words added in dictionary.
.TP
.B -a word
add \fBword\fP to the filter.
.TP
.B -A \fIdictfile\fP
add all words from \fIdictfile\fP to the filter.
add all words from \fIdictfile\fP to the filter. To indicate that program is working
\fBapgbfm\fP prints dot for every 100 words added in dictionary.
.TP
.B -c word
check \fBword\fP for appearance in the filter.
@@ -88,6 +95,9 @@ check \fBword\fP for appearance in the filter.
.B -C \fIdictfile\fP
check every word from \fIdictfile\fP for appearance in the filter.
.TP
.B -q
quiet mode.
.TP
.B -v
print version information.
.TP