Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Hhan, Minki"'
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 obtain a lower bound on the cost of quantum lattice sieving with a bounded
Externí odkaz:
http://arxiv.org/abs/2410.15565
Autor:
Hhan, Minki
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 model (GGM), we find simple alternative proofs for the lower bounds o
Externí odkaz:
http://arxiv.org/abs/2402.11269
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 $m$-qubit outputs for any $m=\omega(\log \lambda)$, where $\lambda$ is the
Externí odkaz:
http://arxiv.org/abs/2312.16025
We demonstrate a substantial gap between local and nonlocal strategies in a quantum state discrimination task under a non-destructiveness condition. The condition imposes additional constraints to conventional state discrimination that the initial st
Externí odkaz:
http://arxiv.org/abs/2308.16032
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, algorithms that do not exploit any properties of the group encoding. We estab
Externí odkaz:
http://arxiv.org/abs/2307.03065
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here an experiment is presented to demonstrate the use of Rydberg atoms to solve
Externí odkaz:
http://arxiv.org/abs/2302.14369
Publikováno v:
Eurocrypt 2023
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 was from quantum gravity, we show its applications in quantum cryptogra
Externí odkaz:
http://arxiv.org/abs/2210.05978
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 397-413 (2020)
The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, the variants of the ACD problem based on Chinese remainder theorem (CRT) are being used in the constructi
Externí odkaz:
https://doaj.org/article/fa34482afa184d3583945291f5dd5085
Publikováno v:
Other repository
© 2019, International Association for Cryptologic Research. We initiate a systematic study of pseudorandom functions (PRFs) that are computable by simple matrix branching programs; we refer to these objects as “matrix PRFs”. Matrix PRFs are attr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::a38ce3104da5f585c8e74b74ca1a6884
https://hdl.handle.net/1721.1/137165
https://hdl.handle.net/1721.1/137165
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.