2012
DOI: 10.6028/nist.sp.800-107r1
|View full text |Cite
|
Sign up to set email alerts
|

Recommendation for applications using approved hash algorithms

Abstract: Hash functions that compute a fixed-length message digest from arbitrary length messages are widely used for many purposes in information security. This document provides security guidelines for achieving the required or desired security strengths when using cryptographic applications that employ the approved hash functions specified in Federal Information Processing Standard (FIPS) 180-4. These include functions such as digital signatures, Keyed-hash Message Authentication Codes (HMACs) and Hash-based Key Der… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
37
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 58 publications
(37 citation statements)
references
References 4 publications
0
37
0
Order By: Relevance
“…If parameters are selected without accounting for the tightness gap in the reduction, then the MAC scheme is shown to provide a level of security that is less than what one would desire in the multi-user setting. In particular, the attacks we describe are effective on HMAC as standardized in [33,26] and CMAC as standardized in [28,72]. In §3, we show that this deficiency in the security assurances provided by the non-tight proof appears in a network authentication protocol [20], and in §4 we obtain analogous results for aggregate MACs and aggregate designated verifier signatures.…”
Section: Bbs Generatormentioning
confidence: 48%
See 3 more Smart Citations
“…If parameters are selected without accounting for the tightness gap in the reduction, then the MAC scheme is shown to provide a level of security that is less than what one would desire in the multi-user setting. In particular, the attacks we describe are effective on HMAC as standardized in [33,26] and CMAC as standardized in [28,72]. In §3, we show that this deficiency in the security assurances provided by the non-tight proof appears in a network authentication protocol [20], and in §4 we obtain analogous results for aggregate MACs and aggregate designated verifier signatures.…”
Section: Bbs Generatormentioning
confidence: 48%
“…We next argue that Attack 1 is effective on HMAC as standardized in [33,26] and CMAC as standardized in [28,72].…”
Section: An Attack On Mac*mentioning
confidence: 99%
See 2 more Smart Citations
“…SHA-3 is based on a completely different mathematical structure as its predecessors SHA-2 and SHA-1. SHA-1 is known to be vulnerable against collision attacks and is therefore not recommended to be used in new designs [11]. Although these weaknesses do not affect the security of SHA-2 to the present date, emerging issues can be expected in the future since it shares the mathematical structure of SHA-1.…”
Section: Security Protocol Extension: Proposal and Performance Immentioning
confidence: 99%