ARIRANG, HAS-160, PKC98-Hash의 축소된 단계들에 대한 역상공격
Preimage Attacks on Reduced Steps of ARIRANG, HAS-160, and PKC98-Hash
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In this paper, we present the preimage attacks on step-reduced ARIRANG, HAS-160, and PKC98-Hash. We applied Aoki and Sasaki's chunk serach method which they have used in the attack on SHA-0 and SHA-1. Our attacks find the preimages of 35-step ARIRANG, 65-step HAS-160, and 80-step PKC98-Hash. Our results are the best preimage attacks for ARIRANG and HAS-160, and the first preimage attack for PKC98-Hash faster than exhaustive search.
Abstract
In this paper, we present the preimage attacks on step-reduced ARIRANG, HAS-160, and PKC98-Hash. We applied Aoki and Sasaki's chunk serach method which they have used in the attack on SHA-0 and SHA-1. Our attacks find the preimages of 35-step ARIRANG, 65-step HAS-160, and 80-step PKC98-Hash. Our results are the best preimage attacks for ARIRANG and HAS-160, and the first preimage attack for PKC98-Hash faster than exhaustive search.
참고문헌 (19)
- 한국정보통신기술협회, "해쉬함수표준 - 제2부: 해쉬함수알고리즘표준(HAS-160)", 정보통신단체 표준 TTAS.KO-12.0011, 2000
- 홍득조, "해쉬함수 ARIRANG의 축소된 단계에 대한 역상공격", 정보보호학회논문지, 19(5), pp.143~149 (2009), 한국정보보호학회
- U.S.Department of Commerce,National Institute of Standards and Technology, "SECURE HASH STANDARD(SHS)", FIPS 180-3, ~ (2008)
- K.Aoki, "Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1", Advances in Cryptology - CRYPTO 2009, LNCS 5677, pp.70~89 (2009), Springer-Verlag
- "ARIRANG: SHA-3 Proposal"[URL]
- D.H.Chang, "Full-Round Differential Attack on the Original Version of the Hash Function Proposed at PKC’98", SAC 2002,LNCS 2595, pp.160~174 (2003), Springer-Verlag
- H.S.Cho, "Collision Search Attack for 53-Step HAS-160", Information Security and Cryptology-ICISC 2006,LNCS 4296, pp.286~295 (2006), Springer-Verlag
- J.Guo, "Practical Pseudo-Collisions for Hash Functions ARIRANG-224", 384, 197, pp.2009, ~
- D.J. Hong, "Improved Preimage Attack for 68-Step HAS-160", ICISC 2010
- J.Kelsey, "Second Preimages on n-bit Hash Functions for Much Less Than 2n Work", Advances in Cryptology-EUROCRYPT 2005,LNCS 3494, pp.474~490 (2005), Springer-Verlag
- F.Mendel, "Collision Message Pair for 53-Step HAS-160", Information Security and Cryptology-ICISC 2007,LNCS 4817, pp.324~334 (2007), Springer-Verlag
- A.J. Menezes, "Handbook of Applied Cryptography" (1996), CRC Press
- R.L.Rivest, "The MD5 Message Digest Algorithm", Request for Comments 1321, ~ (1992)
- Y.Sasaki, "Preimage Attacks on Step-Reduced MD5", ACISP 2008,LNCS 5107, pp.282~296 (2008), Springer-Verlag
- Y.Sasaki, "Preimage Attacks on 3,4,and 5-Pass HAVAL", Advances in Cryptology-ASIACRYPT 2008,LNCS 5350, pp.253~271 (2008), Springer-Verlag
- Y.Sasaki, "A Preimage Attack for 52-Step HAS-160", Information Security and Cryptology-ICISC 2008,LNCS 5461, pp.302~317 (2008), Springer-Verlag
- Y.Sasaki, "Finding Preimages in Full MD5 Faster Than Exhaustive Search", Advances in Cryptology-EUROCRYPT 2009,LNCS 5479, pp.134~152 (2009), Springer-Verlag
- S.U.Shin, "A New Hash Function Based on MDx-Family and Its Application to MAC", PKC’98,LNCS 1431, pp.234~246 (1998), Springer-Verlag
- A.R.Yun, "Finding Collision on 45-Step HAS-160", Information Security and Cryptology-ICISC 2005,LNCS 3935, pp.146~155 (2007), Springer-Verlag