Cryptographic hash function - CompWisdom
About us  |  Why use us?  |  Press  |  Contact us

 

Topic: Cryptographic hash function



  
 Joel on Software - optimized hash functions
Hash functions that are described as cryptographic are generally the ones which are hard to invert in this sense (amongst other desirable properties).
A cryptographic hash function is designed in such a way that the correlations between any of the bits is kept down to an absolute minimum that can't be used for an attack.
A hash function maps all possible inputs to a limited output.
http://discuss.joelonsoftware.com/?joel.3.135825.23   (2749 words)

  
 Tiger (hash) - Wikipedia, the free encyclopedia
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.
Tiger — A Fast New Hash Function, by Ross Anderson and Eli Biham, proceedings of Fast Software Encryption 3, Cambridge, 1996.
Therfore in the example below the 192-bit (24-byte) Tiger hashes are represented as 48-digit hexadecimal numbers in big endian byte order.
http://en.wikipedia.org/wiki/Tiger_(hash)   (351 words)

  
 Cryptographic Algorithms
Cryptographic hash functions are used in various contexts, for example to compute the message digest when making a digital signature.
A cryptographic hash function does this in a way that makes it extremely difficult to come up with a message that would hash to a particular hash value.
The standard defines DSS to use the SHA-1 hash function exclusively to compute message digests.
http://www.crazylinux.net/mirrors/www.ssh.fi/algorithms.htm   (6453 words)

  
 hash function - OneLook Dictionary Search
Phrases that include hash function: one-way hash function, one way hash function, cryptographic hash function, perfect hash function, tiger hash function, more...
hash function : Free On-line Dictionary of Computing [home, info]
hash function : Hutchinson Dictionary of Computers, Multimedia, and the Internet [home, info]
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=hash+function   (140 words)

  
 so-much-for-md5
The problem is that MD5 and SHA-1 are _the_ cryptographic hash functions.
A cryptographic hash function must be considered broken if b) does no longer hold, even if the attack is very expensive, as long as it is feasible.
The point about a cryptographic hash function ("message digest") is that a) it is impossible (read: computationally infeasible) to generate a message whose digest matches a given digest.
http://www.crackmonkey.org/~nick/mail/so-much-for-md5   (968 words)

  
 Hash Functions
Universal One-Way Hash Functions and their Cryptographic Applications
A Parallelizable Design Principle for Cryptographic Hash Functions
"Cryptographic hash functions: a survey" by S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk, 1995
http://www.cs.ut.ee/~helger/crypto/link/hash   (243 words)

  
 search.php?m=exact&w=k&q=samhain
It is easy to configure, maintains a single database (per host) for storing signatures of files, and uses a fast 192-bit cryptographic hash function (TIGER) to generate such signatures.
Samhain allows you to monitor the integrity of your files, whether on a single machine or on a network.
http://www.icewalkers.com/search.php?m=exact&w=k&q=samhain   (87 words)

  
 Science Math Applications Communication Theory Cryptography Algorithms Message Digests
RIPEMD-160 hash function - A 160-bit cryptographic hash function designed as a secure replacement MD4, MD5, and RIPEMD.
Tiger: A Fast New Hash Function - Optimized for 64-bit processors and produces 128, 160, or 192-bit hashes.
Whirlpool Hashing Function - A 512-bit hashing function, submitted to NESSIE and selected as finalist.
http://www.iper1.com/iper1-odp/scat/id/Science/Math/Applications/Communication_Theory/Cryptography/Algorithms/Message_Digests   (166 words)

  
 README-Cryptographic
Cryptographic Hash Functions - MD5 (Message Digest Algorithm 5) - MD2, MD4 - SHA (Secure Hash Algorithm) - Tiger - RIPEMD-160 : most recent hash function -
# IDEA (International Data Encryption Algorithm) - a 128 bit key # RC4 - used to be a trade secret # SAFER # Ciphers based on a hash function # Enigma # Vigenere 3.
Block Cipher Modes - block ciphers means that they take a fixed-size block of data(usually 64 bits), an transform it to another 64bit block using a fuction selected by the key.
http://www.cs.uml.edu/~byoo/www_bjryu/IW/README-Cryptographic   (783 words)

  
 Hash function - Wikipedia, the free encyclopedia
Hash functions that are truly random with uniform output (including most cryptographic hash functions) yield good performance because, on average, only one or two probes will be needed (depending on the load factor).
Just as cryptographic one-way functions are examples of hash functions, cryptographic trapdoor functions are examples of randomization functions.
Then compute the hash function again at the receiver, and if the hash values do not match, there was an error.
http://en.wikipedia.org/wiki/Hash_function   (1292 words)

  
 Cryptographic hash function - Wikipedia, the free encyclopedia
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.
The SHA hash functions are a series of functions developed by the NSA: SHA, also known as SHA-0, SHA-1 and four flavours of a function known as SHA-2.
An ideal hash function would be maximally "boring": it would have no interesting properties such as length extension, and the only interesting way it would differ from a random function would be in that it was deterministic and efficiently computable.
http://en.wikipedia.org/wiki/Cryptographic_hash_function   (1460 words)

  
 AspEncrypt.com - Crypto 101: One-way Hash Function
A one-way hash function, also known as a message digest, fingerprint or compression function, is a mathematical function which takes a variable-length input string and converts it into a fixed-length binary sequence.
Furthermore, a one-way hash function is designed in such a way that it is hard to reverse the process, that is, to find a string that hashes to a given value (hence the name one-way.) A good hash function also makes it hard to find two strings that would produce the same hash value.
Since it is computationally infeasible to produce a document that would hash to a given value or find two documents that hash to the same value, a document's hash can serve as a cryptographic equivalent of the document.
http://www.aspencrypt.com/crypto101_hash.html   (307 words)

  
 cryptographic hash function: Information From Answers.com
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.
An ideal hash function would be maximally "boring": it would have no interesting properties such as length extension, and the only interesting way it would differ from a random function would be in that it was deterministic and efficiently computable.
The SHA hash functions are a series of functions developed by the NSA: SHA, also known as SHA-0, SHA-1 and four flavours of a function known as SHA-2.
http://www.answers.com/topic/cryptographic-hash-function   (307 words)

  
 Cryptographic hash function - Wikipedia, the free encyclopedia
Broadly speaking, a cryptographic hash function should behave as much as possible like a random function while still being deterministic and efficiently computable.
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.
The SHA hash functions are a series of functions developed by the NSA: SHA, also known as SHA-0, SHA-1 and four flavours of a function known as SHA-2.
http://en.wikipedia.org/wiki/Cryptographic_hash_function   (1457 words)

  
 rfc2104.txt
Definition of HMAC The definition of HMAC requires a cryptographic hash function, which we denote by H, and a secret key K. We assume H to be a cryptographic hash function where data is hashed by iterating a basic compression function on blocks of data.
In particular, hash functions that perform well in software, and for which code is freely and widely available.
In particular, it uses the function H with the pre-defined initial value IV (a fixed value specified by each iterative hash function to initialize its compression function).
http://www.ietf.org/rfc/rfc2104.txt   (2246 words)

  
 hash function - OneLook Dictionary Search
Phrases that include hash function: one-way hash function, one way hash function, cryptographic hash function, perfect hash function, tiger hash function, more...
hash function : Free On-line Dictionary of Computing [home, info]
hash function : Hutchinson Dictionary of Computers, Multimedia, and the Internet [home, info]
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=hash+function   (140 words)

  
 Hash function - Wikipedia, the free encyclopedia
Hash functions that are truly random with uniform output (including most cryptographic hash functions) yield good performance because, on average, only one or two probes will be needed (depending on the load factor).
Then compute the hash function again at the receiver, and if the hash values do not match, there was an error.
Typical hash functions have an infinite domain, such as byte strings of arbitrary length, and a finite range, such as bit sequences of some fixed length.
http://en.wikipedia.org/wiki/Hash_function   (1193 words)

  
 Patent 6055314: System and method for secure purchase and delivery of video content programs
A hash function is a mathematical function that converts an input data stream into a fixed-size, often smaller, output data stream that is representative of the input data stream.
One appropriate cryptographic function to perform this secondary expansion is an algorithm known as "WAKE." The random set of bits has a size of 256 K bytes.
The method as recited in claim 57, wherein the first cryptographic expansion function is a function of two keys, and further comprising destroying one of the keys after using the first cryptographic function so that one of the keys never leaves the integrated circuit card.
http://www.freepatentsonline.com/6055314.html   (1193 words)

  
 hmac.html
Our schemes, NMAC and HMAC, are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.
Moreover they use the hash function (or its compression function) as a black box, so that widely available library code or hardware can be used to implement them in a simple way, and replaceability of the underlying hash function is easily supported.
HMAC is a hash function based message authentication code that was designed to meet the requierments of the IPSEC working group in the IETF, and is now a standard.
http://www-cse.ucsd.edu/users/mihir/papers/hmac.html   (483 words)

  
 N-Hash - Wikipedia
In cryptography, N-Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure.
A message is divided into 128-bit blocks, and each block is combined with the hash value computed so far using the g compression function.
Miyaguchi, K. Ohta, and M. Iwata: "128-bit hash function (N-hash)", NTT Review, 2(6), November 1990, pp128–132.
http://en.wikipedia.org/wiki/N-Hash   (483 words)

  
 SHA-1
SHA-1 ( Secure Hash Algorithm) is a message digest algorithm (and cryptographic hash function) designed by the National Security Agency (NSA) and published by the National Institute of Standards and Technology (NIST).
These new hash functions have not received as much scrutiny by the public cryptographic community as SHA-1 has, and so their cryptographic security is not yet as assured.
SHA-1, SHA-256, SHA-384, and SHA-512 are the required secure hash algorithms for use in U.S. Federal applications, including use by other cryptographic algorithms and protocols, for the protection of sensitive unclassified information.
http://www.sciencedaily.com/encyclopedia/sha_1   (483 words)

  
 HASH Functions
RIPMD-160 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.
A "Hash function" is a complex encryption algorithm used primarily in cryptography, and is like a shortened version of full-scale encryption.
This scenario is a perfect candidate for "one-way hash encryption" also known as a message digest, digital signature, one-way encryption, digital fingerprint, or cryptographic hash.
http://www.infocellar.com/networks/Security/hash.htm   (483 words)

  
 SHA iButton Secrets and Challenges - Maxim/Dallas
The output of the SHA function is essentially pseudo-random to an observer who does not know the input to the function.
In Dallas SHA iButton and IC devices, the result of the SHA function is a 20-byte long MAC.
A method for accomplishing unique token secrets is to use the SHA function to generate a MAC of the token ID and perhaps some other token or owner identity data (like a PIN or password), using the system master secret.
http://www.maxim-ic.com/appnotes.cfm?an_pk=152   (3004 words)

  
 Tiger: A Fast New Hash Function - Anderson, Biham (ResearchIndex)
Abstract: Among those cryptographic hash function which are not based on block ciphers, MD4 and Snefru seemed initially quite attractive for applications requiring fast software hashing.
Anderson, E. Biham, "Tiger: a fast new hash function," Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp.
25 A Fast Software One-Way Hash Function (context) - Merkle - 1990
http://citeseer.lcs.mit.edu/anderson96tiger.html   (430 words)

  
 The RIPEMD-160 page
Preneel, A. Bosselaers, H. Dobbertin, ``The cryptographic hash function RIPEMD-160,'' CryptoBytes, Vol.
The OAEP (Optimal Asymmetric Encryption Padding) encoding method is parametrized by the choice of the hash function and mask generation function.
A full description and reference C software for the RIPEMD-160 and RIPEMD-128 hash functions are available: ps, pdf.
http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html   (1704 words)

  
 Hash Functions Based on Block Ciphers and Quaternary Codes - Knudsen, Preneel (ResearchIndex)
We consider constructions for cryptographic hash functions based on m-bit block ciphers.
194 Universal one-way hash functions and their cryptographic app..
in ISO IEC 10118 2 [1] This is due to fatal design flaw that leaves the hash function susceptible to the solving one half attacks described in [2] For recent work on how best to design a hash function using a block cipher see
http://citeseer.ist.psu.edu/knudsen96hash.html   (1704 words)

  
 MD5 - Enpsychlopedia
In cryptography, MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value.
While this was not an attack on the full MD5 hash function, it was close enough for cryptographers to recommend switching to a replacement, such as WHIRLPOOL, SHA-1 or RIPEMD-160.
MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function, MD4.
http://www.grohol.com/psypsych/wiki/MD5   (1704 words)

  
 Available checksum functions
A cryptographic hash function is a one-way function
One common usage of a such a hash function is the computation of
For computing checksums of files, and also for some other purposes, samhain uses the TIGER hash function developed by Ross Anderson and Eli Biham.
http://la-samhna.de/samhain/manual/hash-function.html   (115 words)

  
 md5deep
Tiger is a fast new hash function, designed to be very fast on modern computers, and in particular on the state-of-the-art 64-bit computers.
Whirlpool is a hash function designed by Vincent Rijmen and Paulo S. Barreto that operates on messages less than 2
Hashes sets can be drawn from the National Software Reference Library, iLook Investigator, Hashkeeper, or md5sum, and other generic hash generating programs.
http://md5deep.sourceforge.net   (115 words)

  
 SHACAL-1 Definition / SHACAL-1 Research
[click for more] SHA-1 The SHA (Secure Hash Algorithm) family is a set of related cryptographic hash functions designed by the National Security Agency (NSA) and published by the US government agency National Institute of Standards and Technology (NIST).
SHACAL is a 160-bit block cipher based on the cryptographic hash function 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....
http://www.elresearch.com/SHACAL-1   (115 words)

Compwisdom
 About us   |  Why use us?   |  Press   |  Contact us

 Copyright © 2006 CompWisdom.com Usage implies agreement with terms.