Related papers: Cryptanalysis of quantum permutation pad

The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes can be totally insecure. We provide a thorough investigation of security…

In ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic signal and a clipped neural network (CNN) for encryption. The present paper analyzes the security of this chaotic cipher against chosen-plaintext attacks, and points…

Securing information transmission is critical today. However, with rapidly developing powerful quantum technologies, conventional cryptography techniques are becoming more prone to attacks each day. New techniques in the realm of quantum…

With the constantly advancing capabilities of quantum computers, conventional cryptographic systems relying on complex math problems may encounter unforeseen vulnerabilities. Unlike regular computers, which are often deemed cost-ineffective…

Aiming at a ternary quantum logic circuit, four symmetric ternary quantum homomorphic encryption schemes, based on ternary quantum one-time protocol, were presented. First, for a one-qutrit rotation gate, a homomorphic quantum encryption…

Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was noted that quantum computers could break public key cryptosystems…

Exploring the symmetries underlying a previously proposed encryption scheme which relies on single-qubit rotations, we derive an improved upper bound on the maximum information that an eavesdropper might extract from all the available…

A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more…

Quantum key distribution (QKD) gradually has become a crucial element of practical secure communication. In different scenarios, the security analysis of genuine QKD systems is complicated. A universal secret key rate calculation method,…

In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on…

Nowadays, equivalence problems are widely used in cryptography, most notably to establish cryptosystems such as digital signatures, with MEDS, LESS, PERK as the most recent ones. However, in the context of matrix codes, only the code…

With the tremendous benefits of internet and advanced communications, there is a serious threat from the data security perspective. There is a need of secure and robust encryption algorithm that can be implemented on each and diverse…

Here we introduce the application of Tensor Networks (TN) to launch attacks on symmetric-key cryptography. Our approaches make use of Matrix Product States (MPS) as well as our recently-introduced Flexible-PEPS Quantum Circuit Simulator…

Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics. Composability-based…

The gold-standard for security in quantum cryptographic protocols is information-theoretic security. Information-theoretic security is surely future-proof, because it makes no assumptions on the hardness of any computational problems and…

In this paper we analyze the security of the so-called quantum tomographic cryptography with the source producing entangled photons via an experimental scheme proposed in Phys. Rev. Lett. 92, 37903 (2004). We determine the range of the…

We develop matrix cryptography based on linear recurrent sequences of any order that allows securing encryption against brute force and chosen plaintext attacks. In particular, we solve the problem of generalizing error detection and…

We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers…

Line map, an invertible, two-dimensional chaotic encryption algorithm was introduced recently. In this paper, we propose several weaknesses of the method based on standard cryptanalytic attacks. We perform a side-channel attack by observing…

We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the codespace performed via…