SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions
By Morris Dworkin. 2015
1,328 citations recorded by the source corpus.
This Standard specifies the Secure Hash Algorithm-3 (SHA-3) family of functions on binary data. Each of the SHA-3 functions is based on an instance of the K ECCAK algorithm that NIST selected as the winner of the SHA-3 Cryptographic Hash Algorithm Competition. This Standard also specifies the K ECCAK - p family of mathematical permutations, including the permutation that underlies K ECCAK , in order to facilitate the development of additional permutation-based cryptographic functions. The SHA-3 family consists of four cryptographic hash functions, called SHA3-224, SHA3-256, SHA3-384, and SHA3-512, and two extendable-output functions (XOFs), called SHAKE128 and SHAKE256. Hash functions are components for many important information security applications, including 1) the generation and verification of digital signatures, 2) key derivation, and 3) pseudorandom bit generation. The hash functions specified in this Standard supplement the SHA-1 hash function and the SHA-2 family of hash functions that are specified in FIPS 180-4, the Secure Hash Standard. Extendable-output functions are different from hash functions, but it is possible to use them in similar ways, with the flexibility to be adapted directly to the requirements of individual applications, subject to additional security considerations.
Subfields: Artificial Intelligence, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/4e1b5b26e6ca38b8c7602a73b7087288edbf85c9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Léo Ducas
- Peter Schwabe
- Damien Stehlé
- Frederik Vercauteren
- Vadim Lyubashevsky
- Tancrède Lepoint
- Sujoy Sinha Roy
- Michael Naehrig
In Molecular Biology
- Tiago M. Fernández-Caramés
- Paula Fraga-Lamas
- Jan-Pieter D'Anvers
- Eike Kiltz
- Peter Schwabe
- Frederik Vercauteren
- Léo Ducas
- Tancrède Lepoint
Citations in the corpus
- Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, methodology): “In the case of [211], the authors propose to improve Bit-coin (which uses the Koblitz curve secp256k1 and SHA-256 during the ECDSA signature process) with TESLA# [212], which makes use of BLAKE2 [213] and SHA-3 [214].”
- Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM (2018, methodology): “Matrix A generation Since A consists of 9 polynomials, each having 256 13-bit coefficients, we use SHAKE-128 to generate 9 · 256 · 13/8 = 3, 744 pseudorandom bytes.”
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, methodology): “We decided to instantiate all hash functions with functions derived from Keccak as standardized in FIPS 202 [60].”