<--- Back to Details
First PageDocument Content
Cryptography / Cryptographic hash functions / NIST hash function competition / Flynn's taxonomy / Parallel computing / SIMD / SHA-3 / Hash function / Block cipher / MerkleDamgrd construction / One-way compression function
Date: 2018-06-14 07:12:39
Cryptography
Cryptographic hash functions
NIST hash function competition
Flynn's taxonomy
Parallel computing
SIMD
SHA-3
Hash function
Block cipher
MerkleDamgrd construction
One-way compression function

SHA-3 submission – Tweaked version: SIMD Is a Message Digest Principal submitter: Ga¨etan Leurent

Add to Reading List

Source URL: who.rocq.inria.fr

Download Document from Source Website

File Size: 782,49 KB

Share Document on Facebook

Similar Documents

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

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

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

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

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

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

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

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