Search
Search Results
-
Exact distributed quantum algorithm for generalized Simon’s problem
Simon’s problem is one of the most important problems demonstrating the power of quantum algorithms, as it greatly inspired the proposal of Shor’s...
-
Quantum Attacks: A View of Data Complexity on Offline Simon’s Algorithm
Simon’s algorithm has shown a threat to block ciphers in the quantum setting, especially accelerating attacks with superposition queries. Sometimes...
-
Breaking tweakable enciphering schemes using Simon’s algorithm
We show the applicability of Simon’s period finding quantum algorithm to the cryptanalysis of several tweakable enciphering schemes (TESs), namely,...
-
On the Simon’s Congruence Neighborhood of Languages
Given an integer k, Simon’s congruence relation says that two strings u and v are...
-
Simon’s Algorithm and Symmetric Crypto: Generalizations and Automatized Applications
In this paper we deepen our understanding of how to apply Simon’s algorithm to break symmetric cryptographic primitives. On the one hand, we automate...
-
Tight Bounds for Simon’s Algorithm
Simon’s algorithm is the first example of a quantum algorithm exponentially faster than any classical algorithm, and has many applications in...
-
Matching Patterns with Variables Under Simon’s Congruence
We introduce and investigate a series of matching problems for patterns with variables under Simon’s congruence. Our results provide a thorough...
-
On Simon’s Congruence Closure of a String
Two strings are Simon’s \(\sim _k\) -congruent if they have...
-
Simon’s Algorithm and Autocorrelation Spectrum
Simon’s algorithm is another important evidence that more efficient evaluations of certain properties are possible in quantum domain over the...
-
Quantum Advantage with Deutsch-Jozsa, Bernstein-Vazirani, and Simon’s Algorithms
In this chapter, we study three algorithms of little practical use but important because they were the first to show that quantum computers can solve...
-
Nearly k-Universal Words - Investigating a Part of Simon’s Congruence
Determining the index of Simon’s congruence is a long outstanding open problem. Two words u and v are called Simon congruent if they have the same...
-
\(\alpha \) - \(\beta \) -Factorization and the Binary Case of Simon’s Congruence
In 1991 Hébrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word’s scattered factors (also...
-
Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
Farfalle is a permutation-based construction for building a pseudorandom function which has been proposed by Bertoni et al. in 2017. In this work, we...
-
Post-quantum security on the Lai–Massey scheme
Post-quantum cryptography has attracted much attention from worldwide cryptologists. A growing number of symmetric cryptography algorithms have been...
-
Analysis of Quantum Cryptology and the RSA Algorithms Defense Against Attacks Using Shor’s Algorithm in a Post Quantum Environment
Over the course of the previous twenty years, quantum cryptanalysis has become an important topic of research. The development of two well-known...
-
Quantum Algorithm for Finding Impossible Differentials and Zero-Correlation Linear Hulls of Symmetric Ciphers
In this paper, we present quantum algorithms for finding impossible differentials and zero-correlation linear hulls, which are distinguishers for the...
-
Quantum Speed-Up for Multidimensional (Zero Correlation) Linear Distinguishers
This paper shows how to achieve a quantum speed-up for multidimensional (zero correlation) linear distinguishers. A previous work by Kaplan et...
-
On the Piecewise Complexity of Words and Periodic Words
The piecewise complexity h(u) of a word is the minimal length of subwords needed to exactly characterise u. Its piecewise minimality index...
-
Informational Equivalence but Computational Differences? Herbert Simon on Representations in Scientific Practice
To explain why, in scientific problem solving, a diagram can be “worth ten thousand words,” Jill Larkin and Herbert Simon (1987) relied on a computer...
-
Quantum Attacks on Lai-Massey Structure
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...