Not-so-adiabatic quantum computation for the shortest vector problem
File(s)
Published version
OA Location
Author(s)
Joseph, David
Ghionis, Alexandros
Ling, Cong
Mintert, Florian
Type
Journal Article
Abstract
Since quantum computers are known to break the vast majority of currently used cryptographic protocols, a variety of new protocols are being developed that are conjectured, but not proved, to be safe against quantum attacks. Among the most promising is lattice-based cryptography, where security relies upon problems like the shortest vector problem. We analyze the potential of adiabatic quantum computation for attacks on lattice-based cryptography, and give numerical evidence that even outside the adiabatic regime such methods can facilitate the solution of the shortest vector and similar problems.
Date Issued
2020-03-23
Date Acceptance
2020-02-07
Citation
Physical Review Research, 2020, 2 (1), pp.1-13
ISSN
2643-1564
Publisher
American Physical Society
Start Page
1
End Page
13
Journal / Book Title
Physical Review Research
Volume
2
Issue
1
Copyright Statement
© 2020 The Author(s). Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
License URL
Sponsor
GCHQ
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000602700300008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Grant Number
4201810
Subjects
Science & Technology
Physical Sciences
Physics, Multidisciplinary
Physics
CRYPTOSYSTEMS
Publication Status
Published
Article Number
ARTN 013361
Date Publish Online
2020-03-23