15 citations · 23 across the 15 of their papers we have counts for
9 papers · 1 filter
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…