|
MPhash.dll
Data Hash/Digest
Algorithms
The MPhash.dll is a unique resource, specifically, a set of easy to use APIs
for Hashing. This dll was compiled
using VB 6.0 and utilizes windows API Calls.
This dll should make your
deployment of hashing technology far more straightforward. This product is provided on payment
of a nominal fee ($29) to cover our costs. VB 6.0/VB.N
et/C++ source code can also be supplied upon request.
Pricing depends on source code requested.
Cryptography Introduction
SHA-1 Digest Algorithm (Class
clsSHA)
SHA-1 Standard specifies a Secure
Hash Algorithm, for computing a condensed representation of a message or a data
file. When a message of any length < 264 bits is input, the SHA-1
produces a 160-bit output called a message digest. The message
digest can then be input to the Digital Signature Algorithm (DSA),
which generates or verifies the signature for the message. Signing
the message digest rather than the message often improves the
efficiency of the process because the message digest is usually much
smaller in size than the message. The same hash algorithm must be
used by the verifier of a digital signature/hash as was used by the
creator of the digital signature/hash.
SHA-256 Digest Algorithm
(ClsSHA256 )
SHA-256 is similar to the SHA-1. However
it produces a 256-bit output called a message digest. The message
digest can then be input to the Digital Signature Algorithm (DSA),
which generates or verifies the signature for the message.
MD5 Digest Algorithm
(clsCMD5)
Standard MD5 implementation. Conforms to all standards and can
be used in digital signature or password. MD5 was developed by
Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message
digest makes it a faster implementation than SHA-1.
Huffman
Compression/Decompression
(ClsHuffman)
Also known as Huffman encoding, used for the lossless compression of files
based on the frequency of occurrence of a symbol in the file that is being
compressed. The Huffman algorithm is based on statistical coding, which means
that the probability of a symbol has a direct bearing on the length of its
representation. The more probable the occurrence of a symbol is, the shorter
will be its bit-size representation. In any file, certain characters are used
more than others. Using binary representation, the number of bits required to
represent each character depends upon the number of characters that have to be
represented. Using one bit we can represent two characters, i.e., 0 represents
the first character and 1 represents the second character. Using two bits we can
represent four characters, and so on.
Unlike ASII code, which is a
fixed-length code using seven bits per character, Huffman
compression is a variable-length coding system that assigns smaller
codes for more frequently used characters and larger codes for less
frequently used characters in order to reduce the size of files
being compressed and transferred
Random Key/Number Generator
(clsRandom)
Used to generate random
keys by seeding it with a particular number, which users can
specify. Rather than storing the key, we only need pass on the seed
value, rather than a huge code-key. Provided the same random number
generator is used (usually programming language specific and
platform specific).
| 
