Results 151 to 160 of about 3,529 (191)

Brute-force attack mitigation on remote access services via software-defined perimeter. [PDF]

open access: yesSci Rep
Ruambo FA   +6 more
europepmc   +1 more source

Generic Related-Key Attacks for HMAC [PDF]

open access: yesLecture Notes in Computer Science, 2012
In this article we describe new generic distinguishing and forgery attacks in the related-key scenario (using only a single related-key) for the HMAC construction. When HMAC uses a k-bit key, outputs an n-bit MAC, and is instantiated with an l-bit inner iterative hash function processing m-bit message blocks where m=k, our distinguishing-R attack ...
Thomas Peyrin
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

d-HMAC Dynamic HMAC function

2006 International Conference on Dependability of Computer Systems, 2006
In this paper we want to enhance the powerful of HMAC function (Key-Hashed Message Authentication) to be more resistant against the Exhaustive search attack and Birthday Attack by inventing d-HMAC function (dynamic HMAC function). To achieve our purpose we use dynamic values of ipad and opad.
Mohannad Najjar, Firas Najjar
openaire   +1 more source

The Exact PRF-Security of NMAC and HMAC [PDF]

open access: yesLecture Notes in Computer Science, 2014
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 widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC.
Krzysztof Pietrzak   +2 more
exaly   +4 more sources

Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC [PDF]

open access: yesLecture Notes in Computer Science, 2009
In this paper, we present the first distinguishing attack on HMAC and NMAC based on MD5 without related keys, which distinguishes the HMAC/NMAC-MD5 from HMAC/NMAC with a random function. The attack needs 297 queries, with a success probability 0.87, while the previous distinguishing attack on HMAC-MD5 reduced to 33 rounds takes 2126.1 messages with a ...
Hongbo Yu, Xiaoyun Wang, Tao Zhan
exaly   +3 more sources

Equivalent Key Recovery Attacks Against HMAC and NMAC With Whirlpool Reduced to 7 Rounds [PDF]

open access: yesLecture Notes in Computer Science, 2015
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 Whirlpool, while the previous best attack can work ...
Jian Guo, Meiqin Wang, Long Wen
exaly   +2 more sources

Updates on Generic Attacks Against HMAC and NMAC [PDF]

open access: yesLecture Notes in Computer Science, 2014
In this paper, we present new generic attacks against HMAC and other similar MACs when instantiated with an n-bit output hash function maintaining a l-bit internal state. Firstly, we describe two types of selective forgery attacks (a forgery for which the adversary commits on the forged message beforehand).
Jian Guo, Thomas Peyrin
exaly   +3 more sources

Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5

open access: yesLecture Notes in Computer Science, 2007
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family.
Gaëtan Leurent, Pierre-Alain Fouque
exaly   +2 more sources

Home - About - Disclaimer - Privacy