搜索结果: 1-14 共查到“军事学 NMAC”相关记录14条 . 查询时间(0.093 秒)
We prove the security of NMAC, HMAC, AMAC, and the cascade construction with fixed input-length as quantum-secure pseudo-random functions (PRFs). Namely, they are indistinguishable from a random oracl...
The Exact PRF-Security of NMAC and HMAC
Message authentication codes pseudorandom functions NMAC
2016/1/8
NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a
variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular
and wid...
Equivalent Key Recovery Attacks against HMAC and NMAC with Whirlpool Reduced to 7 Rounds
HMAC NMAC Whirlpool universal forgery
2016/1/4
A main contribution of this paper is an improved analysis against HMAC instantiating with reduced Whirlpool. It recovers equivalent keys, which are often denoted as Kin and Kout, of HMAC with 7-round ...
In this paper, we present universal forgery and key recovery attacks on the most popular
hash-based MAC constructions, e.g., HMAC and NMAC, instantiated with an AES-like hash function
Whirlpool. The...
Generic Security of NMAC and HMAC with Input Whitening
message authentication codes HMAC generic attacks
2015/12/23
HMAC and its variant NMAC are the most popular approaches to deriving a MAC (and
more generally, a PRF) from a cryptographic hash function. Despite nearly two decades of research,
their exact securi...
On the Security of NMAC and Its Variants
NMAC Keying Hash Function Equivalent Key Recovery
2012/6/14
We first propose a general equivalent key recovery attack to a $H^2$-MAC variant NMAC$_1$, which is also provable secure, by applying a generalized birthday attack. Our result shows that NMAC$_1$, eve...
On the Security of NMAC and Its Variants
NMAC Keying Hash Function Equivalent Key Recovery Verifiable Forgery Birthday Attack.
2012/3/21
We first propose a general equivalent key recovery attack to a $H^2$-MAC variant NMAC$_1$, which is also provable secure, by applying a generalized birthday attack. Our result shows that NMAC$_1$, eve...
On the Security of NMAC and Its Variants
NMAC Keying Hash Function Equivalent Key Recovery Verifiable Forgery Birthday Attack.
2012/3/22
We first propose a general equivalent key recovery attack to a $H^2$-MAC variant NMAC$_1$, which is also provable secure, by applying a generalized birthday attack. Our result shows that NMAC$_1$, eve...
Improved Cryptanalysis of APOP-MD4 and NMAC-MD4 using New Differential Paths
MD4 Differential Path APOP NMAC
2009/6/2
In case of security analysis of hash functions, finding a good
collision-inducing differential paths has been only focused on. However,
it is not clear how differential paths of a hash function infl...
General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity
NMAC HMAC Distinguishing Attack Birthday Attack
2009/1/5
Kim et al. [4] and Contini et al. [3] studied on the security of
HMAC and NMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1.
Especially, they considered the distinguishing attacks. However, they did
n...
A New Concept of Hash Functions SNMAC Using a Special Block Cipher and NMAC/HMAC Constructions
Hash function NMAC HMAC
2008/12/25
In this paper, we present new security proofs of well-known hash constructions NMAC/HMAC proposed by Bellare et al. in 1996. We show that block ciphers should be used in hash functions in another way ...
Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
Forgery Partial Key-Recovery Attacks HMAC Hash Collisions
2008/12/18
Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions.
On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1
HMAC NMAC HAVAL MD4 MD5 SHA-0 SHA-1
2008/11/25
HMAC is a widely used message authentication code and a pseudorandom
function generator based on cryptographic hash functions such as MD5 and SHA-1. It
has been standardized by ANSI, IETF, ISO and N...
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
Message authentication hash functions Pseudorandom Functions Carter-Wegman
2008/10/27
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function
is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent attacks
show that...