Abstract
This work was supported in part by the Instituto de Telecomunicacoes, in part by the Fundacao para a Ciencia e a Tecnologia (FCT) under Grant UID/EEA/50008/2019 and Grant PTDC/EEI-HAC/30485/2017, and in part by the National Funds through the Portuguese Funding Agency, FCT—Fundacao para a Ciencia e a Tecnologia, under Grant UID/EEA/50014/2019. The work of A. Mariano was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Grant 382285730.
Highlights
Two decades ago, it was shown that quantum computers will break current cryptosystems
As we show in this paper (Section V explains this in detail), we have identified a gap in the available work: there is very little exploration of heterogeneous platforms in the context of lattice-based cryptosystems and none pertaining to hard attacks, such as those based on the Shortest Vector Problem (SVP), which we solve in this paper
There are two main motivations for this work: 1) we are aware of this algorithm practical limitations, due to increasing memory requirements with the number of dimensions, the actual performance of Voronoi cell was never studied in-depth, something we address in this paper and 2) this is the first paper on a single instance of a SVP attack implemented on a CPU+GPU platform, providing novel insight on how to make use of these platforms in the context of lattice-based cryptanalysis
Summary
It was shown that quantum computers will break current cryptosystems. With the discovery of polynomial time algorithms, solving the underlying mathematical problems, such as factorization of large numbers and the computation of discrete logarithms becomes far simpler [8], [42], [43]. Since finding efficient alternatives to classical cryptosystems, such as RSA and ElGamal, has become a central goal for the cryptography scientific community.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.