Quantum algorithms for typical hard problems: a perspective of cryptanalysis
J Suo, L Wang, S Yang, W Zheng, J Zhang - Quantum Information …, 2020 - Springer
In typical well-known cryptosystem, the hardness of classical problems plays a fundamental
role in ensuring its security. While, with the booming of quantum computation, some …
role in ensuring its security. While, with the booming of quantum computation, some …
Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
A Hosoyamada, Y Sasaki - Security and Cryptography for Networks: 11th …, 2018 - Springer
This paper shows that quantum computers can significantly speed-up a type of meet-in-the-
middle attacks initiated by Demiric and Selçuk (DS-MITM attacks), which is currently one of …
middle attacks initiated by Demiric and Selçuk (DS-MITM attacks), which is currently one of …
Quantum chosen-ciphertext attacks against Feistel ciphers
G Ito, A Hosoyamada, R Matsumoto, Y Sasaki… - Topics in Cryptology–CT …, 2019 - Springer
Seminal results by Luby and Rackoff show that the 3-round Feistel cipher is secure against
chosen-plaintext attacks (CPAs), and the 4-round version is secure against chosen …
chosen-plaintext attacks (CPAs), and the 4-round version is secure against chosen …
Quantum attacks on some Feistel block ciphers
X Dong, B Dong, X Wang - Designs, Codes and Cryptography, 2020 - Springer
Post-quantum cryptography has attracted much attention from worldwide cryptologists.
However, most research works are related to public-key cryptosystem due to Shor's attack …
However, most research works are related to public-key cryptosystem due to Shor's attack …
Quantum cryptanalysis on some generalized Feistel schemes
Post-quantum cryptography has attracted much attention from worldwide cryptologists. In
ISIT 2010, Kuwakado and Morii gave a quantum distinguisher with polynomial time against …
ISIT 2010, Kuwakado and Morii gave a quantum distinguisher with polynomial time against …
On quantum slide attacks
Abstract At Crypto 2016, Kaplan et al. proposed the first quantum exponential acceleration of
a classical symmetric cryptanalysis technique: they showed that, in the superposition query …
a classical symmetric cryptanalysis technique: they showed that, in the superposition query …
4-round Luby-Rackoff construction is a qPRP
A Hosoyamada, T Iwata - International Conference on the Theory and …, 2019 - Springer
Abstract The Luby-Rackoff construction, or the Feistel construction, is one of the most
important approaches to construct secure block ciphers from secure pseudorandom …
important approaches to construct secure block ciphers from secure pseudorandom …
Links between Quantum Distinguishers Based on Simon's Algorithm and Truncated Differentials
Z **ang, X Wang, B Yu, B Sun, S Zhang… - IACR Transactions on …, 2024 - er.ceres.rub.de
In this paper, we study the quantum security of block ciphers based on Simon's period-
finding quantum algorithm. We explored the relations between periodic functions and …
finding quantum algorithm. We explored the relations between periodic functions and …
[KNYGA][B] Квантово-устойчивый блокчейн
А Петренко - 2023 - books.google.com
Сегодня мы наблюдаем рост внимания к технологии блокчейн и распределенного
реестра (англ.-Distributed Ledger Technology, DLT), которая является одной из …
реестра (англ.-Distributed Ledger Technology, DLT), которая является одной из …
Quantum attacks on Lai-Massey structure
S Mao, T Guo, P Wang, L Hu - International Conference on Post-Quantum …, 2022 - Springer
Aaram Yun et al. considered that Lai-Massey structure has the same security as Feistel
structure. However, Luo et al. showed that 3-round Lai-Massey structure can resist quantum …
structure. However, Luo et al. showed that 3-round Lai-Massey structure can resist quantum …