Related papers: Bounds on Key Appearance Equivocation for Substitu…
Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical…
In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole:…
As an alternative to entanglement entropies, the capacity of entanglement becomes a promising candidate to probe and estimate the degree of entanglement of quantum bipartite systems. In this work, we study the typical behavior of…
It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called…
We address criticism of the Letter "Exposed-Key Weakness of $\alpha \eta$" in the Comment by Nair and Yuen. The Comment claims that the Letter does not show insecurity of $\alpha \eta$ because our approximation for the eavesdropper's…
In 1994, Jim Massey proposed the guessing entropy as a measure of the difficulty that an attacker has to guess a secret used in a cryptographic system, and established a well-known inequality between entropy and guessing entropy. Over 15…
In this article, an encryption scheme based on (-1, 1) conference matrix has been developed. The decryption key comprising of fixed number of positive integers with prime power yields the high level security of message. Some popular attacks…
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the "concentration of measure" phenomenon, meaning that on a…
The Even-Mansour cipher is a simple method for constructing a (keyed) pseudorandom permutation $E$ from a public random permutation~$P:\{0,1\}^n \rightarrow \{0,1\}^n$. It is secure against classical attacks, with optimal attacks requiring…
We introduce a novel generalization of entropy and conditional entropy from which most definitions from the literature can be derived as particular cases. Within this general framework, we investigate the problem of designing…
The concept of entropy, firstly introduced in information theory, rapidly became popular in many applied sciences via Shannon's formula to measure the degree of heterogeneity among observations. A rather recent research field aims at…
Recently, Zhang, Li, and Guo have proposed a particular eavesdropping attack [Phys. Rev. A {\bf 63}, 036301 (2001), quant-ph/0009042] which shows that my quantum key distribution protocol based on entanglement swapping [Phys. Rev. A {\bf…
Subword tokenization has become the de-facto standard for tokenization, although comparative evaluations of subword vocabulary quality across languages are scarce. Existing evaluation studies focus on the effect of a tokenization algorithm…
We consider a generalisation of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by qu$N$its (i.e., N-dimensional systems). In order to study its robustness against optimal incoherent attacks, we derive…
We present a security analysis against collective attacks for the recently proposed time-energy entanglement-based quantum key distribution protocol, given the practical constraints of single photon detector efficiency, channel loss, and…
We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot…
With the rapid development of quantum computing, classical cryptography systems are increasingly vulnerable to security threats, thereby highlighting the urgency of constructing architectures that are resilient to quantum computing attacks.…
A During last two decades, there has been a prolific growth in the chaos based image encryption algorithms. Up to an extent these algorithms have been able to provide an alternative to exchange large media files (images and videos) over the…
Spectral properties of an arbitrary matrix can be characterized by the entropy of its rescaled singular values. Any quantum operation can be described by the associated dynamical matrix or by the corresponding superoperator. The entropy of…
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This…