2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CR2025
Equilibrium SAT based PQC: New aegis against quantum computing
Keum-Bae Cho
Public-key cryptography algorithms have evolved towards increasing computational complexity to hide desired messages, which is accelerating with the development of the Internet and…
cs.CC2018★ 2 cited
Indistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP
Keum-Bae Cho
This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguis…
cs.CC2014★ 1 cited
The number system hidden inside the Boolean satisfiability problem
Keum-Bae Cho
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler.…