Jiseung Kim

ORCID: 0000-0002-0850-839X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Cryptographic Implementations and Security
  • Chaos-based Image/Signal Encryption
  • Coding theory and cryptography
  • Complexity and Algorithms in Graphs
  • Cryptography and Residue Arithmetic
  • Formal Methods in Verification
  • semigroups and automata theory
  • Gut microbiota and health
  • Microbial Metabolites in Food Biotechnology
  • Logic, programming, and type systems
  • Benford’s Law and Fraud Detection
  • Polynomial and algebraic computation
  • Gastrointestinal motility and disorders
  • DNA and Biological Computing
  • Network Traffic and Congestion Control
  • Probiotics and Fermented Foods
  • Security and Verification in Computing
  • Advanced Queuing Theory Analysis
  • Computability, Logic, AI Algorithms
  • Advanced Steganography and Watermarking Techniques
  • Advanced Database Systems and Queries
  • Advanced Malware Detection Techniques
  • Computational Physics and Python Applications
  • Advanced Wireless Network Optimization

Chungbuk National University
2022-2023

Jeonbuk National University
2022-2023

Korea Institute for Advanced Study
2021

Seoul National University
2018-2020

National Institute for Mathematical Sciences
2018-2019

Kyungil University
2010-2018

ORCID
2018

Abstract We previously proposed the Gut Microbiome Wellness Index (GMWI), a predictor of disease presence based on gut microbiome taxonomic profile. As an application this index for food science research, we applied GMWI as quantitative tool measuring prebiotic effect oligosaccharides. Mainly, in vitro anaerobic batch fermentation system, fructooligosaccharides (FOS), galactooligosaccharides (GOS), xylooligosaccharides (XOS), inulin (IN), and 2’-fucosyllactose (2FL), were mixed separately...

10.1038/s41538-023-00195-1 article EN cc-by npj Science of Food 2023-05-09

Abstract The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, the of ACD based on Chinese remainder theorem (CRT) are being in constructions a batch fully homomorphic encryption encrypt multiple messages one ciphertext. Despite utility CRT-variant scheme, algorithms that secures security foundation not probed well enough. this paper, we propose two results experiments which proposed were solve variant...

10.1515/jmc-2019-0031 article EN cc-by-nc-nd Journal of Mathematical Cryptology 2020-10-20

A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution. While several encryption schemes have been published their securities depend on presumed hardness variant PACD problem, fewer studies attempted to extend SDA be applicable these variants. In this study, is extended solve general problem. order proceed, first variants are classified how for each suggested. Technically, authors show...

10.1049/ise2.12032 article EN cc-by IET Information Security 2021-06-05

Indistinguishability Obfuscation (iO) is a hopeful tool which obfuscates program with the least-possible leakage, and produces various applications including functional encryption deniable encryption. Recently, Halevi et. al. proposed state-of-the-art obfuscator implementation, called HHSS obfuscation, in ACM-CCS'17. In this paper, we describe polynomial time distinguishing attack on obfuscation. other words, show that there exist two functionally equivalent branching programs but obfuscated...

10.1109/access.2018.2850361 article EN cc-by-nc-nd IEEE Access 2018-01-01

We propose an algorithm that test membership for regular expressions and show the is correct. This written in style of a sequent proof system. The advantage this over traditional ones complex conversion process from to finite automata not needed. As consequence, our simple extends easily various extensions such as timed or languages with intersection.

10.48550/arxiv.1002.2203 preprint EN other-oa arXiv (Cornell University) 2010-01-01

<p style='text-indent:20px;'>In this paper, we propose the first heuristic algorithm for finding small roots a bivariate equation modulo an ideal <inline-formula><tex-math id="M3">\begin{document}$ \mathcal{I} $\end{document}</tex-math></inline-formula> over ring of integers id="M4">\begin{document}$ \mathcal{R} $\end{document}</tex-math></inline-formula>. Existing algorithms solving polynomial equations with size constraints only work modular integers, and univariate number fields....

10.3934/amc.2022012 article EN Advances in Mathematics of Communications 2022-03-03

Abstract Measuring prebiotic activities of foods on human microbiome and providing dietary guidelines one’s health status are an emerging research topic. However, it is difficult to directly compare different using the index (PI) proposed in 2003 determine their activities. This ambiguity can be resolved with gut (GMHI), newly built 2020, a consortium 50 microbial species associated health. As translational application this index, we used formula predict PI five commercial prebiotics,...

10.21203/rs.3.rs-2267424/v1 preprint EN cc-by Research Square (Research Square) 2022-11-29

The authors present a classical polynomial-time attack against the branching program obfuscator of Fernando–Rasmussen–Sahai (for short FRS, Asiacrypt’17) (with one zerotest parameter), which is robust all known cryptanalyses on obfuscators when instantiated with CLT13 multilinear map. first step to recover plaintext modulus To achieve goal, Coron and Notarnicola (Asiacrypt’19) algorithm applied. However, because parameter issues, cannot be used directly. In order detour issue, convert an FRS...

10.1049/ise2.12055 article EN IET Information Security 2021-12-20
Coming Soon ...