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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of systems science and complexity Ročník 35; číslo 1; s. 373 - 412
Hlavní autoři:	Chen, Yu-Ao, Gao, Xiao-Shan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.02.2022 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!