<--- Back to Details
First PageDocument Content
SHA-2 / SHA-1 / Hash function / Preimage attack / MD5 / MD4 / RIPEMD / NIST hash function competition / One-way compression function / Cryptographic hash functions / Error detection and correction / Cryptography
Date: 2008-12-11 06:48:42
SHA-2
SHA-1
Hash function
Preimage attack
MD5
MD4
RIPEMD
NIST hash function competition
One-way compression function
Cryptographic hash functions
Error detection and correction
Cryptography

Add to Reading List

Source URL: ehash.iaik.tugraz.at

Download Document from Source Website

File Size: 367,63 KB

Share Document on Facebook

Similar Documents

Cryptography / Cryptographic hash functions / One-way compression function / Block cipher / SHA-1 / Hash function

An abridged version, reference [2], appears as Advances in Cryptology – CRYPTO ’02, Lecture Notes in Computer Science, Vol. ????, M. Yung, ed., Springer-Verlag. This is the full version. Black-Box Analysis of the Blo

DocID: 1qpw6 - View Document

Cryptography / Cryptographic hash functions / Information retrieval / Search algorithms / Hashing / Permutations / Error detection and correction / Hash function / Advantage / Birthday attack / Parity of a permutation / One-way compression function

An earlier version of this paper appeared in EurocryptSecurity/Efficiency Tradeoffs for Permutation-Based Hashing Phillip Rogaway1 and John Steinberger2 1

DocID: 1q3qz - View Document

Cryptography / Block cipher / Advantage / Pseudorandom permutation / Data Encryption Standard / Feistel cipher / Stream ciphers / Distinguishing attack / Exclusive or / Advanced Encryption Standard / Running key cipher / One-way compression function

Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers Peter Gaˇzi ETH Zurich, Switzerland Department of Computer Science

DocID: 1llOc - View Document

Cryptography / Advantage / Block cipher / Pseudorandom permutation / Feistel cipher / Cardinal number / One-way compression function / Index of cryptography articles

Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading? Peter Gaˇzi1,2 and Stefano Tessaro3,4 1 Department of Computer Science, Comenius University, Bratislava, Slovakia

DocID: 1kVR0 - View Document