CMPH(1) User Commands CMPH(1)NAME
cmph - minimum perfect hashing tool
SYNOPSIS
cmph [-v] [-h] [-V] [-k nkeys] [-f hash_function] [-g [-c value][-s seed] ] [-a algorithm] [-M memory_in_MB] [-b BRZ_parameter] [-d
tmp_dir] [-m file.mph] keysfile
DESCRIPTION
Command line tool to generate and query minimal perfect hash functions.
Please refer to http://cmph.sf.net for full documentation.
-h Print an help message
-c This value determines: the number of vertices in the graph for the algorithms BMZ and CHM; the number of bits per key required in
the FCH algorithm
-a Algorithm. Valid values are: bmz, bmz8, chm, brz, fch
-f hash function (may be used multiple times). valid values are: djb2, fnv, jenkins, sdbm
-V Print version number and exit
-v Increase verbosity (may be used multiple times)
-k Number of keys
-g Generation mode
-s Random seed
-m Minimum perfect hash function file
-M Main memory availability (in MB)
-d Temporary directory used in brz algorithm
-b Parameter of BRZ algorithm to make the maximal number of keys in a bucket lower than 256
keysfile
Line separated file with keys
EXAMPLE
$ # Using the default algorithm (chm) for constructing a mphf
$ # for keys in file keys_file. Lines in keys_file _must_ be unique.
$ ./cmph -v -g keys_file
$ # Query id of keys in the file keys_query
$ ./cmph -v -m keys_file.mph keys_query
AUTHOR
This manual page was written by Enrico Tassi <gareuselesinge@users.sourceforge.net>, for the Debian project (but may be used by others).
cmph 0.6 October 2007 CMPH(1)
Check Out this Related Man Page
ISC-HMAC-FIXUP(1) BIND9 ISC-HMAC-FIXUP(1)NAME
isc-hmac-fixup - fixes HMAC keys generated by older versions of BIND
SYNOPSIS
isc-hmac-fixup {algorithm} {secret}
DESCRIPTION
Versions of BIND 9 up to and including BIND 9.6 had a bug causing HMAC-SHA* TSIG keys which were longer than the digest length of the hash
algorithm (i.e., SHA1 keys longer than 160 bits, SHA256 keys longer than 256 bits, etc) to be used incorrectly, generating a message
authentication code that was incompatible with other DNS implementations.
This bug has been fixed in BIND 9.7. However, the fix may cause incompatibility between older and newer versions of BIND, when using long
keys. isc-hmac-fixup modifies those keys to restore compatibility.
To modify a key, run isc-hmac-fixup and specify the key's algorithm and secret on the command line. If the secret is longer than the digest
length of the algorithm (64 bytes for SHA1 through SHA256, or 128 bytes for SHA384 and SHA512), then a new secret will be generated
consisting of a hash digest of the old secret. (If the secret did not require conversion, then it will be printed without modification.)
SECURITY CONSIDERATIONS
Secrets that have been converted by isc-hmac-fixup are shortened, but as this is how the HMAC protocol works in operation anyway, it does
not affect security. RFC 2104 notes, "Keys longer than [the digest length] are acceptable but the extra length would not significantly
increase the function strength."
SEE ALSO
BIND 9 Administrator Reference Manual, RFC 2104.
AUTHOR
Internet Systems Consortium
COPYRIGHT
Copyright (C) 2010 Internet Systems Consortium, Inc. ("ISC")
BIND9 January 5, 2010 ISC-HMAC-FIXUP(1)
Here's my work of testing whether a number input is perfect or not..
echo Enter a number
read no
i=1
ans=0
while
do
if
then
ans='expr $ans + $i'
fi
i='expr $i + 1'
done
if
then
echo $no is perfect
else
echo $no is NOT perfect
fi (12 Replies)
Hi!
I am trying to create a script to reorder the contents of a text file. Below is the text file initially, followed by how I would like it reordered:
File initially:
---
Initial lines with text and/or numbers
Initial lines with text and/or numbers
Initial lines with text and/or numbers... (11 Replies)
Hi All,
Please can you help with the output whole line for each host (column 3) and the top line of column 9 - the lastest only
What is being outputted
243272484 3 nbmedln1p03 LDN_TEST_UX_JM 1488198368 0000000007 1 INC_1MTH 0 **********
243272492 3 nbmedln1p03 LDN_TEST_UX_JM... (10 Replies)