<--- Back to Details
First PageDocument Content
Cryptography / Cryptographic hash functions / Error detection and correction / Hashing / NIST hash function competition / Secure Hash Algorithms / SHA-3 / SHA-1 / Crypt / SHA-2
Date: 2017-02-27 12:19:53
Cryptography
Cryptographic hash functions
Error detection and correction
Hashing
NIST hash function competition
Secure Hash Algorithms
SHA-3
SHA-1
Crypt
SHA-2

Comments Received in Response to: Request for Comments on Draft Revision of the Applicability Clause of FIPS 180-4, Secure Hash Standard

Add to Reading List

Source URL: csrc.nist.gov

Download Document from Source Website

File Size: 65,50 KB

Share Document on Facebook

Similar Documents

Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories  ECC Workshop 2013, 2013–09–17

Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories ECC Workshop 2013, 2013–09–17

DocID: 1rgOn - View Document

Lanarea DF Haneef Mubarak Abstract The flaws of current and previous methods of utilization, storage, and conversion of passwords into secure keys, namely plaintext, hashing, and key derivation are explored. A novel, yet

Lanarea DF Haneef Mubarak Abstract The flaws of current and previous methods of utilization, storage, and conversion of passwords into secure keys, namely plaintext, hashing, and key derivation are explored. A novel, yet

DocID: 1nAAh - View Document

Secure Names for Bit-Strings Stuart Haber*  W. Scott Stornetta*

Secure Names for Bit-Strings Stuart Haber* W. Scott Stornetta*

DocID: 16K7v - View Document

Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, Korea

Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, Korea

DocID: 12NLC - View Document

Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group   Abstract. In this work we consider generic algorithms to find near-collisions for a hash

Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find near-collisions for a hash

DocID: 12HMr - View Document