Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems

This paper presents a quantum algorithm to decide whether a Boolean equation system F has a solution and to compute one if F does have solutions with any given success probability. The runtime complexity of the algorithm is polynomial in the size of F and the condition number of certain Macaulay mat...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of systems science and complexity Jg. 35; H. 1; S. 373 - 412
Hauptverfasser:	Chen, Yu-Ao, Gao, Xiao-Shan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.02.2022 Springer Nature B.V
Schlagworte:	Algorithms Boolean Boolean algebra Complex Systems Computer systems Control Cryptography Encryption Hash based algorithms Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Polynomials Quantum computers Statistics Systems Theory Block cipher AES hash function SHA-3/Keccak Boolean equation solving quantum algorithm polynomial system solving stream cipher Trivum condition number HHL algorithm MPKC
ISSN:	1009-6124, 1559-7067
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!