all InfoSec news
Qubo model for the Closest Vector Problem. (arXiv:2304.03616v1 [cs.CR])
April 10, 2023, 1:10 a.m. | Eduardo Canale, Claudio Qureshi, Alfredo Viola
cs.CR updates on arXiv.org arxiv.org
In this paper we consider the closest vector problem (CVP) for lattices
$\Lambda \subseteq \mathbb{Z}^n$ given by a generator matrix $A\in
\mathcal{M}_{n\times n}(\mathbb{Z})$. Let $b>0$ be the maximum of the absolute
values of the entries of the matrix $A$. We prove that the CVP can be reduced
in polynomial time to a quadratic unconstrained binary optimization (QUBO)
problem in $O(n^2(\log(n)+\log(b)))$ binary variables, where the length of the
coefficients in the corresponding quadratic form is $O(n(\log(n)+\log(b)))$.
absolute binary generator lambda length log matrix optimization problem prove
More from arxiv.org / cs.CR updates on arXiv.org
Proactive Detection of Voice Cloning with Localized Watermarking
2 days, 15 hours ago |
arxiv.org
NFT Wash Trading: Direct vs. Indirect Estimation
2 days, 15 hours ago |
arxiv.org
Backdoor Attack with Sparse and Invisible Trigger
2 days, 15 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Senior Security Researcher - Linux MacOS EDR (Cortex)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Sr. Manager, NetSec GTM Programs
@ Palo Alto Networks | Santa Clara, CA, United States
SOC Analyst I
@ Fortress Security Risk Management | Cleveland, OH, United States