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
Jobs in InfoSec / Cybersecurity
Security Engineer
@ Celonis | Munich, Germany
Security Engineer, Cloud Threat Intelligence
@ Google | Reston, VA, USA; Kirkland, WA, USA
IT Security Analyst*
@ EDAG Group | Fulda, Hessen, DE, 36037
Scrum Master/ Agile Project Manager for Information Security (Temporary)
@ Guidehouse | Lagunilla de Heredia
Waste Incident Responder (Tanker Driver)
@ Severn Trent | Derby , England, GB
Risk Vulnerability Analyst w/Clearance - Colorado
@ Rothe | Colorado Springs, CO, United States