Jaechul  Sung

Prof. Jaechul Sung


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 March 2013 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
KJKitae Jeong
Kitae Jeong
YLYuseop Lee
Yuseop Lee
JSJaechul Sung
Jaechul Sung
SHSeokhie Hong
Seokhie Hong
PRESENT is a hardware-optimized 64-bit lightweight block cipher which supports 80- and 128-bit secret keys. In this paper, we propose a differential fault analysis (DFA) on PRESENT-80/128. The proposed attack is based on a 2-byte random fault model. In detail, by inducing several 2-byte random faults in input registers after 28 rounds, our attack recovers the secret key of the target algorithm. From simulation results, our attacks on PRESENT-80/128 can recover the secret key by inducing only two and three 2-byte random faults, respectively. These are superior to known DFA results on them.

31 January 2012 in Mathematical and Computer Modelling
Verified
Journal Article
Closed access
PDF file
KJKitae Jeong
Kitae Jeong
YLYuseop Lee
Yuseop Lee
JSJaechul Sung
Jaechul Sung
SHSeokhie Hong
Seokhie Hong

8 November 2021 in IEEE Access
Verified
Journal Article
Open access
HKHangi Kim
Hangi Kim
YJYongjin Jeon
Yongjin Jeon
GKGiyoon Kim
Giyoon Kim
JKJongsung Kim
Jongsung Kim
BSBo-Yeon Sim
Bo-Yeon Sim
DHDeukjo Hong
Deukjo Hong
Bit permutations are efficient linear functions often used for lightweight cipher designs. However, they have low diffusion effects, compared to word-oriented binary and maximum distance separable (MDS) matrices. Thus, the security of bit permutation-based ciphers is significantly affected by differential and linear branch numbers (DBN and LBN) of nonlinear functions. In this paper, we introduce a widely applicable method for constructing S-boxes with high DBN and LBN. Our method exploits constructions of S-boxes from smaller S-boxes and it derives/proves the required conditions for smaller S-boxes so that the DBN and LBN of the constructed S-boxes are at least 3. These conditions enable us to significantly reduce the search space required to create such S-boxes. Using the unbalanced- Bridge and unbalanced- MISTY structures, we develop a variety of new lightweight S-boxes that provide not only both DBN and LBN of at least 3 but also efficient bitsliced implementations including at most 11 nonlinear bitwise operations. The new S-boxes are the first that exhibit these characteristics.

11 May 2013 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
KJKitae Jeong
Kitae Jeong
HKHyungChul Kang
HyungChul Kang
Changhoon LeeChanghoon Lee
Changhoon Lee
JSJaechul Sung
Jaechul Sung
Seokhie HongSeokhie Hong
Seokhie Hong
JLJong In Lim
Jong In Lim

1 January 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
KJKitae Jeong
Kitae Jeong
YLYuseop Lee
Yuseop Lee
JSJaechul Sung
Jaechul Sung
SHSeokhie Hong
Seokhie Hong
In Choukri and Tunstall (2005), the authors showed that if they decreased the number of rounds in AES by injecting faults, it is possible to recover the secret key. In this paper, we propose fault injection attacks on HMAC/NMAC by applying the main idea of their attack. These attacks are applicable to HMAC/NMAC based on the MD-family hash functions and can recover the secret key with the negligible computational complexity. Particularly, these results on HMAC/NMAC-SHA-2 are the first known key recovery attacks so far.

9 May 2008 in Journal of Systems and Software
Verified
Journal Article
Closed access
CLChanghoon Lee
Changhoon Lee
JKJongsung Kim
Jongsung Kim
SHSeokhie Hong
Seokhie Hong
JSJaechul Sung
Jaechul Sung
Sangjin LeeSangjin Lee
Sangjin Lee