Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing

In the paper, we study lattice-based cryptographic problems, in particular Learning With Errors (LWE) and Short Integer Solution (SIS) lattice problems, which are considered to be known cryptographic primitives that are supposed to be secure against both classical and quantum attacks. We formulated...

Full description

Bibliographic Details
Published in:Прикладная дискретная математика. Приложение № 16. С. 117-123
Main Author: Qayyum, Abdul
Other Authors: Haris, Muhammad
Format: Article
Language:English
Subjects:
Online Access:http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001006018
Перейти в каталог НБ ТГУ
LEADER 02259nab a2200337 c 4500
001 koha001006018
005 20250916135115.0
007 cr |
008 230915|2023 ru s a eng d
024 7 |a 10.17223/2226308X/16/30  |2 doi 
035 |a koha001006018 
040 |a RU-ToGU  |b rus  |c RU-ToGU 
100 1 |a Qayyum, Abdul  |9 1006005 
245 1 0 |a Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing  |c A. Qayyum, M. Haris 
336 |a Текст 
337 |a электронный 
504 |a Библиогр.: 15 назв. 
520 3 |a In the paper, we study lattice-based cryptographic problems, in particular Learning With Errors (LWE) and Short Integer Solution (SIS) lattice problems, which are considered to be known cryptographic primitives that are supposed to be secure against both classical and quantum attacks. We formulated the LWE and SIS problems as Mixed-Integer Programming (MIP) model and then converted them to Quadratic Unconstrained Binary Optimization (QUBO) problem, which can be solved by using a quantum annealer. Quantum annealing searches for the global minimum of an input objective function subjected to the given constraints to optimize the given model. We have estimated the q-bits required for the Quantum Processing Unit (QPU). Our results show that this approach can solve certain instances of the LWE and SIS problems efficiently. 
653 |a постквантовая криптография 
653 |a криптография на решетках 
653 |a целочисленные решения 
653 |a квадратичная бинарная оптимизация без ограничений 
655 4 |a статьи в журналах  |9 893130 
700 1 |a Haris, Muhammad  |9 893131 
773 0 |t Прикладная дискретная математика. Приложение  |d 2023  |g  № 16. С. 117-123  |x 2226-308X  |w to000620992 
852 4 |a RU-ToGU 
856 4 |u http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001006018 
856 |y Перейти в каталог НБ ТГУ  |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=1006018 
908 |a статья 
039 |b 100 
999 |c 1006018  |d 1006018