Search results for: Deukjo Hong

Items from 1 to 20 out of 20 results

chapter

A Chosen Plaintext Linear Attack on Block Cipher CIKS-1

Changhoon Lee, Deukjo Hong, Sungjae Lee, Sangjin Lee, more

Lecture Notes in Computer Science > Information and Communications Security > Cryptanalysis & Cryptographic Techniques > 456-468

In this paper, we firstly evaluate the resistance of the reduced 5-round version of the block cipher CIKS-1 against linear crypt-analysis(LC). A feature of the CIKS-1 is the use of both Data-Dependent permutations(DDP) and internal key scheduing which consist in data-dapendent transformation of the round subkeys. Taking into account the structure of CIKS-1 we investigate linear approximation. That...

chapter

Known-IV Attacks on Triple Modes of Operation of Block Ciphers

Deukjo Hong, Jaechul Sung, Seokhie Hong, Wonil Lee, more

Lecture Notes in Computer Science > Advances in Cryptology — ASIACRYPT 2001 > Block Ciphers > 208-221

With chosen-IV chosen texts, David Wagner has analyzed the multiple modes of operation proposed by Eli Biham in FSE’98. However, his method is too unrealistic. We use only known-IV chosen texts to attack many triple modes of operation which are combined with cascade operations. 123 triple modes are analyzed with complexities less than E. Biham’s results. Our work shows that the securities of many...

chapter

Improved Preimage Attack for 68-Step HAS-160

Deukjo Hong, Bonwook Koo, Yu Sasaki

Lecture Notes in Computer Science > Information, Security and Cryptology – ICISC 2009 > Cryptanalysis of Hash Function > 332-348

In this paper, we improve previous preimage attacks on hash function HAS-160, which is standardized in Korea. We show that the last 68 steps out of 80 steps of HAS-160 can be attacked, while a previous attack works for only intermediate 52 steps. We also show that the first 67 steps of HAS-160 can be attacked. These attacks are based on the meet-in-the-middle attack, which is also used in the previous...

chapter

How to Construct Universal One-Way Hash Functions of Order r

Deukjo Hong, Jaechul Sung, Seokhie Hong, Sangjin Lee

Lecture Notes in Computer Science > Progress in Cryptology - INDOCRYPT 2005 > Hash Functions > 63-76

At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damgård) or some-level TR (TRee) extension...

chapter

HIGHT: A New Block Cipher Suitable for Low-Resource Device

Deukjo Hong, Jaechul Sung, Seokhie Hong, Jongin Lim, more

Lecture Notes in Computer Science > Cryptographic Hardware and Embedded Systems - CHES 2006 > Low Resources > 46-59

In this paper, we propose a new block cipher HIGHT with 64-bit block length and 128-bit key length. It provides low-resource hardware implementation, which is proper to ubiquitous computing device such as a sensor in USN or a RFID tag. HIGHT does not only consist of simple operations to be ultra-light but also has enough security as a good encryption algorithm. Our hardware implementation of HIGHT...

chapter

Key Recovery Attacks on the RMAC, TMAC, and IACBC

Jaechul Sung, Deukjo Hong, Sangjin Lee

Lecture Notes in Computer Science > Information Security and Privacy > Cryptanalysis (II) > 265-273

The RMAC[6] is a variant of CBC-MAC, which resists birthday attacks and gives provably full security. The RMAC uses 2k-bit keys and the size of the RMAC is 2n, where n is the size of underlying block cipher. The TMAC[10] is the improved MAC scheme of XCBC[4] such that it requires (k +n)-bit keys while the XCBC requires (k +2n)-bit keys. In this paper, we introduce trivial key recovery attack on the...

chapter

Linear Cryptanalysis on SPECTR-H64 with Higher Order Differential Property

Youngdai Ko, Deukjo Hong, Seokhie Hong, Sangjin Lee, more

Lecture Notes in Computer Science > Computer Network Security > Cryptography > 298-307

In this paper, we find linear equations of SPECTR-H64 using the property of controlled permutation boxes. Also, we construct the fourth-order differential structure using the property that the algebraic degree of the function G is 3, which is the only non-linear part of SPECTR-H64. These linear equations and structures enable us to attack the reduced 6 round SPECTR-H64. So, we can recover the 6-th...

chapter

A Weak Key Class of XTEA for a Related-Key Rectangle Attack

Eunjin Lee, Deukjo Hong, Donghoon Chang, Seokhie Hong, more

Lecture Notes in Computer Science > Progress in Cryptology - VIETCRYPT 2006 > Cryptanalysis > 286-297

XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2^108.21. Our attack on a 34-round reduced version of XTEA under weak key...

chapter

Higher Order Universal One-Way Hash Functions

Deukjo Hong, Bart Preneel, Sangjin Lee

Lecture Notes in Computer Science > Advances in Cryptology - ASIACRYPT 2004 > Hash Functions > 201-213

Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from the family. Their main security property is that it should be hard to find a second input that collides with the target input. This paper generalizes the concept of UOWHFs to UOWHFs of order r. We demonstrate that it is possible...

chapter

Impossible Differential Cryptanalysis of Zodiac

Deukjo Hong, Jaechul Sung, Shiho Moriai, Sangjin Lee, more

Lecture Notes in Computer Science > Fast Software Encryption > Cryptanalysis of Block Ciphers III > 300-311

We discuss the impossible differential cryptanalysis of the block cipher Zodiac [7]. The main design principles of Zodiac are simplicity and efficiency. However the diffusion layer in its round function is too simple to offer enough security. An impossible differential cryptanalysis is a proper method to attack the weakness of Zodiac. Our attack using two 14-round impossible characteristics derives...

chapter

Differential Cryptanalysis of TEA and XTEA

Seokhie Hong, Deukjo Hong, Youngdai Ko, Donghoon Chang, more

Lecture Notes in Computer Science > Information Security and Cryptology - ICISC 2003 > Block/Stream Ciphers > 402-417

TEA and XTEA are simple block ciphers consisting of exclusive-or, addition, and shift. Although their round functions are very simple and guarantee a little security, large number of 64 rounds have made them secure enough. It seems that the best result for TEA is the related-key attack [3], but it is less reasonable than such attacks for one key as differential and linear attacks. Impossible differential...

chapter

Preimage Attacks on Reduced Steps of ARIRANG and PKC98-Hash

Deukjo Hong, Bonwook Koo, Woo-Hwan Kim, Daesung Kwon

Lecture Notes in Computer Science > Information, Security and Cryptology – ICISC 2009 > Cryptanalysis of Hash Function > 315-331

In this paper, we present the preimage attacks on step-reduced ARIRANG and PKC98-Hash. Our attacks find the preimages of 35 steps out of 40 steps of ARIRANG and 80 steps out of 96 steps of PKC98-Hash, faster than the brute force attack. We applied recently developed techniques of preimage attack. Our attack for ARIRANG is the improvement of the previous attack, and our attack for PKC98-hash is the...

chapter

Related-Key Attack on the Full HIGHT

Bonwook Koo, Deukjo Hong, Daesung Kwon

Lecture Notes in Computer Science > Information Security and Cryptology - ICISC 2010 > Cryptanalysis > 49-67

HIGHT is a lightweight block cipher, proposed in CHES 2006 , and on the process of ISO/IEC 18033-3 standardization. It is a 32-round Feistel-like block cipher with 64-bit block and 128-bit key. In this paper, we present the first attack on the full HIGHT using related-key rectangle attack with 2^123.169 encryptions, 2^57.84 data, and 4 related keys. Our related-key rectangle attack is valid for 2¹²⁶...

chapter

Improved Fast Correlation Attack on the Shrinking and Self-shrinking Generators

Kitae Jeong, Jaechul Sung, Seokhie Hong, Sangjin Lee, more

Lecture Notes in Computer Science > Progress in Cryptology - VIETCRYPT 2006 > Cryptanalysis > 260-270

The fast correlation attack on the shrinking generator proposed by Zhang et al. in [8] has a room for improvement that the probability that the guessing bit is incorrect increases in certain case. In this paper, we propose a method to improve Zhang et al.’s attack. Reflecting our idea, the fast correlation attack on the shrinking and self-shrinking generator is more efficient than Zhang et al.’s attack...

chapter

A New Dedicated 256-Bit Hash Function: FORK-256

Deukjo Hong, Donghoon Chang, Jaechul Sung, Sangjin Lee, more

Lecture Notes in Computer Science > Fast Software Encryption > Proposals > 195-209

This paper describes a new software-efficient 256-bit hash function, FORK-256. Recently proposed attacks on MD5 and SHA-1 motivate a new hash function design. It is designed not only to have higher security but also to be faster than SHA-256. The performance of the new hash function is at least 30% better than that of SHA-256 in software. And it is secure against any known cryptographic attacks on...

article

Improved preimage attacks on hash modes of 8-round AES-256

Deukjo Hong, Dong-Chan Kim, Daesung Kwon, Jongsung Kim

Multimedia Tools and Applications > 2016 > 75 > 22 > 14525- 14539

We observe the slow diffusion of the AES key schedule for 256-bit keys and find weakness which can be used in the preimage attack on its Davies-Meyer mode. Our preimage attack works for 8 rounds of AES-256 with the computational complexity of 2^124.9. It is comparable with Bogdanov et al.’s biclique-based preimage attack on AES-256, which is applicable up to full rounds but has the computational complexity...

article

Higher order eTCR hash functions

Deukjo Hong, Dong-Chan Kim, Woo-Hwan Kim, Jongsung Kim

Computers and Mathematics with Applications > 2013 > 65 > 9 > 1396-1402

We study higher order eTCR (enhanced target collision resistance) hash functions, where rth-order eTCR is denoted by eTCR(r). We prove that a few rounds of the MD (Merkle–Damgård) scheme and a few levels of the TR (tree) scheme can be eTCR under the compression function is eTCR(r) for some positive integer r. Additionally, we prove that the TH (tree hash) scheme also preserves eTCR.

article

Collision Resistance of the JH Hash Function

Jooyoung Lee, Deukjo Hong

IEEE Transactions on Information Theory > 2012 > 58 > 3 > 1992 - 1995

In this paper, we analyze collision resistance of the JH hash function in the ideal primitive model. The JH hash function is one of the five SHA-3 candidates accepted for the final round of evaluation. The JH hash function uses a mode of operation based on a permutation, while its security has been elusive even in the random permutation model. One can find a collision for the JH compression function...

article

Cryptanalysis of an involutional block cipher using cellular automata

Jaechul Sung, Deukjo Hong, Seokhie Hong

Information Processing Letters > 2007 > 104 > 5 > 183-185

In 2006, an involutional block cipher using cellular automata was proposed. A self-invertible CA-based structure allows for an efficient hardware implementation. This paper analyzes the insecurity of the cipher due to its conjugate property. The results of this study will make it possible to construct a decryption process without knowledge of the secret key.

article

Known-IV, Known-in-Advance-IV, and Replayed-and-Known-IV Attacks on Multiple Modes of Operation of Block Ciphers

Deukjo Hong, Seokhie Hong, Wonil Lee, Sangjin Lee, more

Journal of Cryptology > 2006 > 19 > 4 > 441-462

Normally, it has been believed that the initial values of cryptographic schemes do not need to be managed secretly unlike the secret keys. However, we show that multiple modes of operation of block ciphers can suffer a loss of security by the state of the initial values. We consider several attacks according to the environment of the initial values; known-IV attack, known-in-advance-IV attack, and...

Filter options

Publication date

Set your own date range

INFONA - science communication portal

Search results for: Deukjo Hong

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Publication type

Keywords

Data set

Journal

Reporting an error / abuse

Sending the report failed

Accessibility options