Related papers: Cryptanalysis of quantum permutation pad
Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation. Focusing on secure communication, quantum cryptography has two major directions of development, namely…
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that persist even if the polynomial hierarchy collapses. We…
Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…
Quantum cryptography exploits principles of quantum physics for the secure processing of information. A prominent example is secure communication, i.e., the task of transmitting confidential messages from one location to another. The…
Strong attacks against quantum key distribution use quantum memories and quantum gates to attack directly the final key. In this paper we extend a novel security result recently obtained, to demonstrate proofs of security against a wide…
The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems…
Plaintext-ciphertext matrix multiplication (PC-MM) is an indispensable tool in privacy-preserving computations such as secure machine learning and encrypted signal processing. While there are many established algorithms for…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
In recent years, the supply and demand of electricity has significantly increased. As a result, the interconnecting grid infrastructure has required (and will continue to require) further expansion, while allowing for rapid resolution of…
A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine…
In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in…
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…
Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to…
A two-layer quantum protocol for secure transmission of data using qubits is presented. The protocol is an improvement over the BB84 QKD protocol. BB84, in conjunction with the one-time pad algorithm, has been shown to be unconditionally…
Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds…
There is no doubt that quantum key distribution is an excellent result as a science. However, this paper presents a view on quantum key distribution (QKD) wherein QKD may have a difficulty to provide a sufficient security and good…
Multiphoton state in quantum cryptography decreases its security. Key disclosing with universal quantum cloning machine (UQCM) is considered in explicit manner. Although UQCM cannot make perfect clones, there is some invariant quantity…
This paper discloses a simple algorithm for encrypting text messages, based on the NP-completeness of the subset sum problem, such that the similarity between encryptions is roughly proportional to the semantic similarity between their…
An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$.…