Cryptographic hash functions Cryptographic hash functions In cryptography, a cryptographic hash function is a hash function with certain additional security properties to make it suitable for use as a primitive in various information security applications, such as authentication and message integrity. A hash function takes a long string (or message) of any length as input and produces a fixed length string as output, sometimes termed a message digest or a digital fingerprint. ...more on Wikipedia about "Cryptographic hash function"
(Gost-Hash) GOST R 34.11-94 is a cryptographic hash function defined as a Soviet standard in 1994. ...more on Wikipedia about "Gost-Hash"
HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It derives from SHA-1, with assorted changes intended to increase its security. It produces a 160-bit output. ...more on Wikipedia about "HAS-160"
In computer science, a hash collision is a situation that occurs when two distinct inputs into a hash function produce identical outputs. ...more on Wikipedia about "Hash collision"
HAVAL is a cryptographic hash function. Unlike most cryptographic hash functions like MD5 and SHA1, HAVAL can produce hashes of different lengths. HAVAL can produce hashes in lengths of 128 bits, 160 bits, 192 bits, 224 bits, and 256 bits. HAVAL also allows users to specify the number of rounds (3, 4, or 5) to be used to generate the hash. ...more on Wikipedia about "HAVAL"
Message Digest Algorithm 2 (MD2) is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers. MD2 is specified in RFC 1319. Although other algorithms have been proposed since, such as MD4, MD5 and SHA, even as of 2004 MD2 remains in use in public key infrastructures as part of certificates generated with MD2 and RSA. ...more on Wikipedia about "MD2"
MD4 is a message digest algorithm (the fourth in a series) designed by Professor Ronald Rivest of MIT in 1990. It implements a cryptographic hash function for use in message integrity checks. The digest length is 128 bits. The algorithm has influenced later designs, such as the MD5, SHA and RIPEMD algorithms. ...more on Wikipedia about "MD4"
Tell your friends about http://www.shortopedia.com shortopedia
In cryptography, MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. As an Internet standard (RFC 1321), MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of files. ...more on Wikipedia about "MD5"
(MDC-2) In cryptography, MDC2 (Modification Detection Code) is a cryptographic hash function with a 128-bit hash value. The , submitted by IBM, expires on August 28, 2007. ...more on Wikipedia about "MDC-2"
The Miyaguchi-Preneel scheme for turning a block cipher into a cryptographic hash function was independently proposed by Shoji Miyaguchi and Bart Preneel. ...more on Wikipedia about "Miyaguchi-Preneel scheme"
In cryptography, N-Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al; weaknesses were published the following year. ...more on Wikipedia about "N-Hash"
OMAC (One-key MAC) is a message authentication code constructed from a block cipher much like the PMAC algorithm. ...more on Wikipedia about "One-key MAC"
PMAC which stands for Parallelizable MAC is a message authentication code algorithm. It was created by Philip Rogaway. ...more on Wikipedia about "PMAC"
Poly1305-AES is a cryptographic message authentication code written by Daniel J. Bernstein. It is quite similar to UMAC. ...more on Wikipedia about "Poly1305-AES"
Please tell your friends about http://www.shortopedia.com
Quantum fingerprinting is a proposed technique that uses a quantum computer to generate a string with a similar function to the cryptographic hash function. ...more on Wikipedia about "Quantum fingerprinting"
A random oracle is a mathematical abstraction used in cryptographic proofs. Random oracles are typically included in proofs when no "real" function (that can be implemented) provides sufficient mathematical properties to satisfy the proof of security. Proofs which make use of random oracles are referred to as secure in the "random oracle model", as opposed to the "standard model". In practice, random oracles are typically used to model cryptographic hash functions in schemes where strong randomness assumptions are needed of the hash function's output. Such proofs indicate that systems or protocols are secure by showing that an attacker must require impossible behavior from the oracle, or solve some other mathematical problem believed hard, in order to break the protocol. Not all uses of cryptographic hash functions require random oracles: schemes which require only the property of collision resistance can be proven secure in the standard model (e.g., the Cramer-Shoup cryptosystem). ...more on Wikipedia about "Random oracle"
RIPEMD-160 ( RACE Integrity Primitives Evaluation Message Digest) is a 160-bit message digest algorithm (and cryptographic hash function) developed in Europe by Hans Dobbertin, Antoon Bosselaers and Bart Preneel, and first published in 1996. It is an improved version of RIPEMD, which in turn was based upon the design principles used in MD4, and is similar in performance to the more popular SHA-1. ...more on Wikipedia about "RIPEMD"
The SHA (Secure Hash Algorithm) family is a set of related cryptographic hash functions. The most commonly used function in the family, SHA-1, is employed in a large variety of popular security applications and protocols, including TLS, SSL, PGP, SSH, S/MIME, and IPSec. SHA-1 is considered to be the successor to MD5, an earlier, widely-used hash function. The SHA algorithms were designed by the National Security Agency (NSA) and published as a US government standard. ...more on Wikipedia about "SHA hash functions"
Snefru is a cryptographic hash function invented by Ralph Merkle which supports 128-bit and 256-bit output. It was named after the Egyptian Pharaoh Sneferu, continuing the tradition of the Khufu and Khafre block ciphers. ...more on Wikipedia about "Snefru"
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1996 with a view for efficiency on 64-bit platforms. The size of a Tiger hash value is 192 bits. There also exists 128 and 160-bit versions of this algorithm, called Tiger/128 and Tiger/160. Both variants return truncated Tiger/192 hash values. ...more on Wikipedia about "Tiger (hash)"
WHIRLPOOL is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto. The hash has been recommended by the NESSIE project. It has also been adopted by the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC) as part of the joint ISO/IEC 10118-3 international standard. ...more on Wikipedia about "WHIRLPOOL" http://www.shortopedia.com , this is it! Cryptographic_hash_functions
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Cryptographic hash functions".
| MAIN PAGE | MAIN INDEX | CONTACT US |