Kitae Jeong
Korea University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Kitae Jeong.
cryptographic hardware and embedded systems | 2006
Deukjo Hong; Jaechul Sung; Seokhie Hong; Jongin Lim; Sangjin Lee; Bonseok Koo; Changhoon Lee; Donghoon Chang; Jesang Lee; Kitae Jeong; Hyun Kim; Jongsung Kim; Seongtaek Chee
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 requires 3048 gates on 0.25 μm technology.
australasian conference on information security and privacy | 2008
Yuseop Lee; Kitae Jeong; Jaechul Sung; Seokhie Hong
The slide resynchronization attack on Grain was proposed in [6]. This attack finds related keys and initialization vectors of Grain that generate the 1-bit shifted keystream sequence. In this paper, we extend the attack proposed in [6] and propose related-key chosen IV attacks on Grain-v1 and Grain-128. The attack on Grain-v1 recovers the secret key with 222.59chosen IVs, 226.29-bit keystream sequences and 222.90computational complexity. To recover the secret key of Grain-128, our attack requires 226.59chosen IVs, 231.39-bit keystream sequences and 227.01computational complexity. These works are the first known key recovery attacks on Grain-v1 and Grain-128.
Mathematical and Computer Modelling | 2012
Kitae Jeong; Yuseop Lee; Jaechul Sung; Seokhie Hong
LED-64 is a 64-bit block cipher proposed in CHES 2011 and suitable for the efficient implementation in constrained hardware environments such as WSN. In this paper, we propose a differential fault analysis on LED-64. In order to recover the secret key of LED-64, this attack requires only one random nibble fault and an exhaustive search of 28. This work is the first known cryptanalytic result on LED-64.
Peer-to-peer Networking and Applications | 2013
Kitae Jeong; Hyung Chul Kang; Changhoon Lee; Jaechul Sung; Seokhie Hong; Jongin Lim
In this paper, we evaluate the security of lightweight block ciphers mCrypton and LED against biclique cryptanalysis. In cases of mCryton-64/96/128, our attacks require computational complexities of
Eurasip Journal on Wireless Communications and Networking | 2013
Kitae Jeong; Changhoon Lee; Jongin Lim
2^{63.18}, 2^{94.81}
International Journal of Distributed Sensor Networks | 2014
Yuseop Lee; Kitae Jeong; Changhoon Lee; Jaechul Sung; Seokhie Hong
and
advanced information networking and applications | 2012
Jinkeon Kang; Kitae Jeong; Sang-Soo Yeo; Changhoon Lee
2^{126.56}
Journal of Applied Mathematics | 2013
Jinkeon Kang; Kitae Jeong; Jaechul Sung; Seokhie Hong; Kyungho Lee
, respectively. These results are the first known biclique cryptanalytic results on mCrypton. The attack on a 29-round reduced LED-64 needs
International Journal of Computer Mathematics | 2013
Kitae Jeong; Yuseop Lee; Jaechul Sung; Seokhie Hong
2^{63.58}
Information Sciences | 2009
Kitae Jeong; Changhoon Lee; Jongsung Kim; Seokhie Hong
29-round reduced LED-64 encryptions. In the cases of LED-80/96/128, we propose the attacks on two versions. First, to recover the secret key of 45-round reduced LED-80/96/128, our attacks require computational complexities of