Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Qipeng Liu:

TR21-126 | 25th August 2021
Yilei Chen, Qipeng Liu, Mark Zhandry

Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

Revisions: 1

We show polynomial-time quantum algorithms for the following problems:
(*) Short integer solution (SIS) problem under the infinity norm, where the public matrix is very wide, the modulus is a polynomially large prime, and the bound of infinity norm is set to be half of the modulus minus a ... more >>>

TR20-090 | 10th June 2020
Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian

Tight Quantum Time-Space Tradeoffs for Function Inversion

Revisions: 1

In function inversion, we are given a function $f: [N] \mapsto [N]$, and want to prepare some advice of size $S$, such that we can efficiently invert any image in time $T$. This is a well studied problem with profound connections to cryptography, data structures, communication complexity, and circuit lower ... more >>>

ISSN 1433-8092 | Imprint