Demo Data from EDBT 2026 / reviewers in the wild / expert
Ju-Sung Kang
dblp:22/1092
· DBLP profile ↗
10ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 4 first-authorTheory of computation · 2Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
block cipher |
0.0 | 1 | 2001 | Provable Security of KASUMI and 3GPP Encryption Mode f8 · ASIACRYPT 2001 |
Cryptographic primitives and cryptanalysis › block cipher
block cipher modes |
0.0 | 1 | 2001 | Provable Security of KASUMI and 3GPP Encryption Mode f8 · ASIACRYPT 2001 |
Cryptographic primitives and cryptanalysis
provable security |
0.0 | 1 | 2001 | Provable Security of KASUMI and 3GPP Encryption Mode f8 · ASIACRYPT 2001 |
Cryptographic primitives and cryptanalysis › public-key cryptography › group-based cryptography
braid group cryptography |
0.0 | 1 | 2000 | New Public-Key Cryptosystem Using Braid Groups · CRYPTO 2000 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.0 | 1 | 2000 | New Public-Key Cryptosystem Using Braid Groups · CRYPTO 2000 |
Methods — techniques the papers use, named apart from their topics
provable security · 0.03GPP · 0.0braid groups · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | A Lightweight BCH Code Corrector of TRNG with Measurable DependenceabstractWe propose a new lightweight BCH code corrector of the random number generator such that the bitwise dependence of the output value is controllable. The proposed corrector is applicable to a lightweight environment and the degree of dependence among the output bits of the corrector is adjustable depending on the bias of the input bits. Hitherto, most correctors using a linear code are studied on the direction of reducing the bias among the output bits, where the biased input bits are independent. On the other hand, the output bits of a linear code corrector are inherently not independent even though the input bits are independent. However, there are no results dealing with the independence of the output bits. The well-known von Neumann corrector has an inefficient compression rate and the length of output bits is nondeterministic. Since the heavy cryptographic algorithms are used in the NIST’s conditioning component to reduce the bias of input bits, it is not appropriate in a lightweight environment. Thus we have concentrated on the linear code corrector and obtained the lightweight BCH code corrector with measurable dependence among the output bits as well as the bias. Moreover, we provide some simulations to examine our results. Hojoong Park, Yongjin Yeom, Ju-Sung Kang |
Secur. Commun. Networks | 3 |
| 2018 | Probability distributions for the Linux entropy estimator
Yongjin Yeom, Ju-Sung Kang |
Discret. Appl. Math. | 2 |
| 2017 | On the Additional Chi-Square Tests for the IID Assumption of NIST SP 800-90BabstractRecently, NIST has published the second draft of SP 800-90B used for entropy estimations of random number generators. It is conducted within the framework of a cryptographic module validation program (CMVP) for the entropy source. The official evaluation criteria such as CMVP should be supported by rigorous and theoretical foundations so as to achieve the credibility and reliability of the evaluation process. For the theoretical background of the entropy estimation, it is assumed in SP 800-90B that the distribution of the entropy source is unknown since we cannot obtain an appropriate hypothesis about the distribution of the noise source which is a component of the entropy source. In this case, the nonparametric statistical method is commonly used. The test suite of SP 800-90B is divided into two major steps. The first step is to determine the track, IID(independent and identically distributed) or Non-IID, and the second step is to estimate the entropy of the given source. The permutation tests and additional chi-square tests are used to test IID assumption for entropy source in the first step, and when all tests in the first step are passed, the given source is determined as IID. Depending on whether the given data is determined as IID or Non-IID, the entropy estimation is conducted using different estimators in the second step. In this paper, we concentrate on the additional chi-square tests and analyze them from the view point of the nonparametric statistical method. We find out several defects of the degrees of freedom in the tests of independence for binary and non-binary data. We correct the degrees of freedom based on our analysis, and it solidifies the theoretical basis of SP 800- 90B. Furthermore, we provide some experimental results with the corrected degrees of freedom which show that the corrected tests are more effective. Ju-Sung Kang, Hojoong Park, Yongjin Yeom |
PST | 1 |
| 2014 | A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations
Ju-Sung Kang, Wangho Ju, Okyeon Yi |
WISTP | 1 |
| 2004 | Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST
Youngdai Ko, Seokhie Hong, Wonil Lee, Sangjin Lee 0002, Ju-Sung Kang |
FSE | 5 |
| 2004 | An extension of TYT algorithm for GF((2n)m) using precomputation
Ku-Young Chang, Howon Kim 0001, Ju-Sung Kang, Hyun Sook Cho |
Inf. Process. Lett. | 3 |
| 2003 | A Concrete Security Analysis for 3GPP-MAC
Dowon Hong, Ju-Sung Kang, Bart Preneel, Heuisu Ryu |
FSE | 2 |
| 2001 | Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
Ju-Sung Kang, Okyeon Yi, Dowon Hong, Hyun Sook Cho |
ACISP | 1 |
| 2001 | Provable Security of KASUMI and 3GPP Encryption Mode f8
Ju-Sung Kang, Sang-Uk Shin, Dowon Hong, Okyeon Yi |
ASIACRYPT | 1 |
| 2000 | New Public-Key Cryptosystem Using Braid Groups
Ki Hyoung Ko, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park |
CRYPTO | 5 |