15 citations · 23 across the 15 of their papers we have counts for
22 papers
Lattices with Large Kissing Number from Local Density
Huck Bennett, Minki Hhan, Zihan Li +1
Let denote the maximum kissing number of a lattice . We prove that for all and that $κ_p(n) \geq Ω…
Trapdoored Clifford Operators and Applications
Minki Hhan, Hojune Lee
Random Clifford operators have numerous applications in quantum computing, including randomized benchmarking, classical shadows, and quantum authentication. However, sampling and i…
Need for Coherent Access in Constructing Quantum Cryptography
Minki Hhan, Changhun Oh, Vaughn Sohn
We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not. At first gla…
An Operator-Norm Approach to Security with Quantum Advice
Minki Hhan, Sunghyuk Jo, Qipeng Liu
Non-uniform security allows an adversary to receive bounded advice about an oracle before attempting a fresh challenge. This captures the most realistic attacks and has already bee…
Quantum Security of XOR of Permutations via Fourier Analysis
Wonseok Choi, Minki Hhan, Junyoung Jang
The XOR of two or more independent random permutations (XoP) is the prototypical pseudorandom function built from permutations achieving security beyond the birthday bound. The cla…
Derivatives of Quantum Randomness: Separating Pseudorandom Unitaries from Pseudorandom (Function-like) States
Minki Hhan
Quantum computation gives rise to new pseudorandom primitives for states and unitaries, including pseudorandom state generators (PRSGs), pseudorandom function-like state generators…
Finding a Shortest Vector and More in Time using -ary Coset Difference Tree
Minki Hhan
This paper presents a new randomized algorithm for solving the exact shortest vector problem. For the -dimensional lattice , our algorithm runs in time and space $2^…
Solving the Shortest Vector Problem in Time via Mid-point Hessian
Minki Hhan
We present randomized algorithms for the shortest vector problem (SVP). For the -dimensional lattice , our algorithms solve SVP in time classicall…
Scalable Enumeration of Pareto-optimal Polymers for Computing Equilibrium Concentrations
Archit Patil, Minki Hhan, David Soloveichik
Predicting equilibrium concentrations of molecular complexes is essential for verifying the behavior of engineered DNA systems. However, a finite set of monomer types can in princi…
Proofs of Quantum Memory
Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka +1
In this paper, we introduce a new concept, proofs of quantum memory (PoQM). A PoQM is an interactive protocol between a classical verifier and a quantum prover over a classical cha…
On Limits on the Provable Consequences of Quantum Pseudorandomness
Samuel Bouaziz--Ermann, Minki Hhan, Garazi Muguruza +1
There are various notions of quantum pseudorandomness, such as pseudorandom unitaries (PRUs), pseudorandom state generators (PRSGs), pseudorandom function-like state generators (PR…
Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
Hamidreza Akef, Minki Hhan, David Soloveichik
Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer le…
Shallow quantum circuit for generating extremely low-entangled approximate state designs
Wonjun Lee, Minki Hhan, Gil Young Cho +1
Random quantum states have various applications in quantum information science. We discover a new ensemble of quantum states that serve as an -approximate state -design while…
Quantum Lifting for Invertible Permutations and Ideal Ciphers
Alexandru Cojocaru, Minki Hhan, Qipeng Liu +2
In this work, we derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models. These theorems relate the success probabilit…
Pseudorandom Function-like States from Common Haar Unitary
Minki Hhan, Shogo Yamada
Recent active studies have demonstrated that cryptography without one-way functions (OWFs) could be possible in the quantum world. Many fundamental primitives that are natural quan…
Does quantum lattice sieving require quantum RAM?
Beomgeun Cho, Minki Hhan, Taehyun Kim +2
In this paper, we study the requirement for quantum random access memory (QRAM) in quantum lattice sieving, a fundamental algorithm for lattice-based cryptanalysis. First, we obtai…
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
Minki Hhan
This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group…
A Note on Output Length of One-Way State Generators and EFIs
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
We study the output length of one-way state generators (OWSGs), their weaker variants, and EFIs. - Standard OWSGs. Recently, Cavalar et al. (arXiv:2312.08363) give OWSGs with -q…
Trade-off between Information Gain and Disturbance in Local Discrimination of Entangled Quantum States
Youngrong Lim, Minki Hhan, Hyukjoon Kwon
We establish an information gain-disturbance trade-off relation in local state discrimination. Our result demonstrates a fundamental limitation of local strategy to discriminate en…
Quantum Complexity for Discrete Logarithms and Related Problems
Minki Hhan, Takashi Yamakawa, Aaram Yun
This paper studies the quantum computational complexity of the discrete logarithm (DL) and related group-theoretic problems in the context of generic algorithms -- that is, algorit…
Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs
Seokho Jeong, Minhyuk Kim, Minki Hhan +1
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here an exp…
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting interference between two orthogonal states is as hard as swapping these states. While their original motivation w…