Zobrazeno 1 - 10
of 1 237
pro vyhledávání: '"Gray Matthew"'
We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribution of binary strings over which it is hard to approximate Kolmogorov
Externí odkaz:
http://arxiv.org/abs/2410.04984
3D Water Quality Mapping using Invariant Extended Kalman Filtering for Underwater Robot Localization
Water quality mapping for critical parameters such as temperature, salinity, and turbidity is crucial for assessing an aquaculture farm's health and yield capacity. Traditional approaches involve using boats or human divers, which are time-constraine
Externí odkaz:
http://arxiv.org/abs/2409.11578
Autor:
Epping Brian, Rapp Michael, Barry Devin, Daskalakis Adam, Danon Yaron, Blain Ezekiel, Brand Peter, Bretti Michael, Gray Matthew, Krusieski Larry, Kerdoun Azeddine, Block Robert, Landsberger Sheldon
Publikováno v:
EPJ Web of Conferences, Vol 284, p 01019 (2023)
A new experiment configuration was designed, developed, and implemented to measure photoneutron yields using the Rensselaer Polytechnic Institute (RPI) electron linear accelerator (LINAC) at the RPI Gaerttner LINAC Center. The experiment configuratio
Externí odkaz:
https://doaj.org/article/2ce9eda920d741d69dfc282ad5efc31a
Recent work has introduced the "Quantum-Computation Classical-Communication" (QCCC) (Chung et. al.) setting for cryptography. There has been some evidence that One Way Puzzles (OWPuzz) are the natural central cryptographic primitive for this setting
Externí odkaz:
http://arxiv.org/abs/2402.17715
We prove the first hardness results against efficient proof search by quantum algorithms. We show that under Learning with Errors (LWE), the standard lattice-based cryptographic assumption, no quantum algorithm can weakly automate $\mathbf{TC}^0$-Fre
Externí odkaz:
http://arxiv.org/abs/2402.10351
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent computati
Externí odkaz:
http://arxiv.org/abs/2312.08363