Yongjin Yeom

Yongjin Yeom


Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
1 January 2004
Verified
Book Chapter
Closed access
PDF file
DKDaesung Kwon
Daesung Kwon
JKJaesung Kim
Jaesung Kim
SPSangwoo Park
Sangwoo Park
SSSoo Hak Sung
Soo Hak Sung
YSYaekwon Sohn
Yaekwon Sohn
JHJin Hong
Jin Hong

12 July 2002
Verified
Book Chapter
Closed access
PDF file
YYYongjin Yeom
Yongjin Yeom
SPSangwoo Park
Sangwoo Park
IKIljun Kim
Iljun Kim

1 January 2005 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
JHJin Hong
Jin Hong
DLDong Hoon Lee
Dong Hoon Lee
YYYongjin Yeom
Yongjin Yeom
DHDaewan Han
Daewan Han

29 January 1999 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
CLChang-Ock Lee
Chang-Ock Lee
JLJongwoo Lee
Jongwoo Lee
DSDongwoo Sheen
Dongwoo Sheen
YYYongjin Yeom
Yongjin Yeom

17 September 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
LZLei Zhang
Lei Zhang
WWWenling Wu
Wenling Wu
JPJe Hong Park
Je Hong Park
BKBon Wook Koo
Bon Wook Koo
YYYongjin Yeom
Yongjin Yeom

13 March 2017 in Entropy
Verified
Journal Article
Open access
PDF file
TYTaeill Yoo
Taeill Yoo
JKJu-Sung Kang
Ju-Sung Kang
YYYongjin Yeom
Yongjin Yeom
Over the past decade, several security issues with Linux Random Number Generator (LRNG) on PCs and Androids have emerged. The main problem involves the process of entropy harvesting, particularly at boot time. An entropy source in the input pool of LRNG is not transferred into the non-blocking output pool if the entropy counter of the input pool is less than 192 bits out of 4098 bits. Because the entropy estimation of LRNG is highly conservative, the process may require more than one minute for starting the transfer. Furthermore, the design principle of the estimation algorithm is not only heuristic but also unclear. Recently, Google released an Internet of Things (IoT) operating system called Brillo based on the Linux kernel. We analyze the behavior of the random number generator in Brillo, which inherits that of LRNG. In the results, we identify two features that enable recovery of random numbers. With these features, we demonstrate that random numbers of 700 bytes at boot time can be recovered with the success probability of 90% by using time complexity for 5.20 × 2 40 trials. Therefore, the entropy of random numbers of 700 bytes is merely about 43 bits. Since the initial random numbers are supposed to be used for sensitive security parameters, such as stack canary and key derivation, our observation can be applied to practical attacks against cryptosystem.