Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userReaching the speed limit of classical block ciphers via quantum-like operator spreading
232
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We cast encryption via classical block ciphers in terms of operator spreading in a dual space of Pauli strings, a formulation which allows us to characterize classical ciphers by using tools well known in the analysis of quantum many-body systems. We connect plaintext and ciphertext attacks to out-of-time order correlators (OTOCs) and quantify the quality of ciphers using measures of delocalization in string space such as participation ratios and corresponding entropies obtained from the wave function amplitudes in string space. In particular, we show that in Feistel ciphers the entropy saturates its bound to exponential precision for ciphers with 4 or more rounds, consistent with the classic Luby-Rackoff result. The saturation of the string-space information entropy is accompanied by the vanishing of OTOCs. Together these signal irreversibility and chaos, which we take to be the defining properties of good classical ciphers. More precisely, we define a good cipher by requiring that the saturation of the entropy and the vanishing of OTOCs occurs to super-polynomial precision, implying that the cipher cannot be distinguished from a pseudorandom permutation with a polynomial number of queries. We argue that this criterion can be satisfied by $n$-bit block ciphers implemented via random reversible circuits with ${cal O}(n log n)$ gates. These circuits are composed of layers of $n/3$ non-overlapping non-local random 3-bit gates. In order to reach this speed limit we employ a two-stage circuit: this first stage deploys a set of linear inflationary gates that accelerate the growth of small individual strings; followed by a second stage implemented via universal gates that exponentially proliferate the number of macroscopic strings. We suggest that this two-stage construction would result in the scrambling of quantum states to similar precision and with circuits of similar size.
rate research
Read More
we will present an estimation for the upper-bound of the amount of 16-bytes plaintexts for English texts, which indicates that the block ciphers with block length no more than 16-bytes will be subject to recover plaintext attacks in the occasions of plaintext -known or plaintext-chosen attacks.
Finding the solutions of the equations that describe the dynamics of a given physical system is crucial in order to obtain important information about its evolution. However, by using estimation theory, it is possible to obtain, under certain limitations, some information on its dynamics. The quantum-speed-limit (QSL) theory was originally used to estimate the shortest time in which a Hamiltonian drives an initial state to a final one for a given fidelity. Using the QSL theory in a slightly different way, we are able to estimate the running time of a given quantum process. For that purpose, we impose the saturation of the Anandan-Aharonov bound in a rotating frame of reference where the state of the system travels slower than in the original frame (laboratory frame). Through this procedure it is possible to estimate the actual evolution time in the laboratory frame of reference with good accuracy when compared to previous methods. Our method is tested successfully to predict the time spent in the evolution of nuclear spins 1/2 and 3/2 in NMR systems. We find that the estimated time according to our method is better than previous approaches by up to four orders of magnitude. One disadvantage of our method is that we need to solve a number of transcendental equations, which increases with the system dimension and parameter discretization used to solve such equations numerically.
The preparation of a mechanical oscillator driven by quantum back-action is a fundamental requirement to reach the standard quantum limit (SQL) for force measurement, in optomechanical systems. However, thermal fluctuating force generally dominates a disturbance on the oscillator. In the macroscopic scale, an optical linear cavity including a suspended mirror has been used for the weak force measurement, such as gravitational-wave detectors. This configuration has the advantages of reducing the dissipation of the pendulum (i.e., suspension thermal noise) due to a gravitational dilution by using a thin wire, and of increasing the circulating laser power. However, the use of the thin wire is weak for an optical torsional anti-spring effect in the cavity, due to the low mechanical restoring force of the wire. Thus, there is the trade-off between the stability of the system and the sensitivity. Here, we describe using a triangular optical cavity to overcome this limitation for reaching the SQL. The triangular cavity can provide a sensitive and stable system, because it can optically trap the mirrors motion of the yaw, through an optical positive torsional spring effect. To show this, we demonstrate a measurement of the torsional spring effect caused by radiation pressure forces.
Lightweight stream ciphers are highly demanded in IoT applications. In order to optimize the hardware performance, a new class of stream cipher has been proposed. The basic idea is to employ a single Galois NLFSR with maximum period to construct the cipher. As a representative design of this kind of stream ciphers, Espresso is based on a 256-bit Galois NLFSR initialized by a 128-bit key. The $2^{256}-1$ maximum period is assured because the Galois NLFSR is transformed from a maximum length LFSR. However, we propose a Galois-to-Fibonacci transformation algorithm and successfully transform the Galois NLFSR into a Fibonacci LFSR with a nonlinear output function. The transformed cipher is broken by the standard algebraic attack and the Ro njom-Helleseth attack with complexity $mathcal{O}(2^{68.44})$ and $mathcal{O}(2^{66.86})$ respectively. The transformation algorithm is derived from a new Fibonacci-to-Galois transformation algorithm we propose in this paper. Compare to existing algorithms, proposed algorithms are more efficient and cover more general use cases. Moreover, the transformation result shows that the Galois NLFSR used in any Espresso-like stream ciphers can be easily transformed back into the original Fibonacci LFSR. Therefore, this kind of design should be avoided in the future.
Operators in ergodic spin-chains are found to grow according to hydrodynamical equations of motion. The study of such operator spreading has aided our understanding of many-body quantum chaos in spin-chains. Here we initiate the study of operator spreading in quantum maps on a torus, systems which do not have a tensor-product Hilbert space or a notion of spatial locality. Using the perturbed Arnold cat map as an example, we analytically compare and contrast the evolutions of functions on classical phase space and quantum operator evolutions, and identify distinct timescales that characterize the dynamics of operators in quantum chaotic maps. Until an Ehrenfest time, the quantum system exhibits classical chaos, i.e. it mimics the behavior of the corresponding classical system. After an operator scrambling time, the operator looks random in the initial basis, a characteristic feature of quantum chaos. These timescales can be related to the quasi-energy spectrum of the unitary via the spectral form factor. Furthermore, we show examples of emergent classicality in quantum problems far away from the classical limit. Finally, we study operator evolution in non-chaotic and mixed quantum maps using the Chirikov standard map as an example.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
