본문 바로가기
KERD
논문KCI 등재

축소된 라운드의 AES 기반 HMAC에 대한 키 복구 공격

Key Recovery Attacks on HMAC with Reduced-Round AES

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류컴퓨터학

초록

It is known that a single-key and a related-key attacks on AES-128 are possible for at most 7 and 8 rounds, respectively. The security of CMAC, a typical block-cipher-based MAC algorithm, has very high possibility of inheriting the security of the underlying block cipher. Since the attacks on the underlying block cipher can be applied directly to the first block of CMAC, the current security margin is not sufficient compared to what the designers of AES claimed. In this paper, we consider HMAC-DM-AES-128 as an alternative to CMAC-AES-128 and analyze its security for reduced rounds of AES-128. For 2-round AES-128, HMAC-DM-AES-128 requires the precomputation phase time complexity of 2 97 AES, the online phase time complexity of 2 98.68 AES and the data complexity of 2 98 blocks. Our work is meaningful in the point that it is the first security analysis of MAC based on hash modes of AES.

Abstract

It is known that a single-key and a related-key attacks on AES-128 are possible for at most 7 and 8 rounds, respectively. The security of CMAC, a typical block-cipher-based MAC algorithm, has very high possibility of inheriting the security of the underlying block cipher. Since the attacks on the underlying block cipher can be applied directly to the first block of CMAC, the current security margin is not sufficient compared to what the designers of AES claimed. In this paper, we consider HMAC-DM-AES-128 as an alternative to CMAC-AES-128 and analyze its security for reduced rounds of AES-128. For 2-round AES-128, HMAC-DM-AES-128 requires the precomputation phase time complexity of 2 97 AES, the online phase time complexity of 2 98.68 AES and the data complexity of 2 98 blocks. Our work is meaningful in the point that it is the first security analysis of MAC based on hash modes of AES.

참고문헌 (9)

  1. "FIPS-197, Announcing the ADVANCED ENCRYPTION STANDARD (AES)", ~ (2009)
  2. Preneel, "Hash functions based on block ciphers: a synthetic approach;CRYPTO 1993", CRYPTO 1993 (1993)
  3. Merkle, "A Design Principle for Hash Functions", CRYPTO '89 Proceedings, pp.416~427 (1989)
  4. Bellare, "New Proofs for NMAC and HMAC: Security without Collision-Resistance;CRYPTO", CRYPTO, pp.602~619 (2006)
  5. Black, "Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV", CRYPTO 2002 (2002)
  6. Leurent, "New Generic Attacks against Hash-Based MACs", ASIACRYPT 2013 (2013)
  7. Menezes, "Handbook of Applied Cryptography" (1996), CRC Press
  8. Derbez, "Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting", EUROCRYPT 2013, pp.371~387 (2013)
  9. Bellare, "Hash function balance and its impact on birthday attacks" (2003), IACR

관련 논문AI추천

이 간행물의 다른 논문 (17건)