Related papers: Goldbach Triples and Key Distribution
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
We consider the distribution of secret keys, both in a bipartite and a multipartite (conference) setting, via a quantum network and establish a framework to obtain bounds on the achievable rates. We show that any multipartite private…
Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just consider a simple broadcast communication task in quantum scenario, which…
The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…
Due to the capability of tolerating high error rate and generating more key bits per trial, high-dimensional quantum key distribution attracts wide interest. Despite great progresses in high-dimensional quantum key distribution, there are…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
Recently spherical codes were introduced as potentially more capable ensembles for quantum key distribution. Here we develop specific key creation protocols for the two qubit-based spherical codes, the trine and tetrahedron, and analyze…
In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots,…
Let $\eta$ be a quadratic irrationality. The variant of a ternary problem of Goldbach involving primes such that $a<\{\eta p\}<b$, where $a$ and $b$ are arbitrary numbers of the interval $(0,1)$, solved in this paper.
Secret sharing allows three or more parties to share secret information which can only be decrypted through collaboration. It complements quantum key distribution as a valuable resource for securely distributing information. Here we take…
We calculate an achievable secret key rate for quantum key distribution with a finite number of signals, by evaluating the min-entropy explicitly. The min-entropy can be expressed in terms of the guessing probability, which we calculate for…
The multicast key-dissemination problem over noiseless networks, introduced by Langberg and Effros [ITW 2022], here called the ``key-cast'' problem, captures the task of disseminating a shared secret random key to a set of terminals over a…
A multi-party quantum key distribution protocol based on repetitive code is designed for the first time in this paper. First we establish a classical (t, n) threshold protocol which can authenticate the identity of the participants, and…
We report on a complete free-space field implementation of a modified Ekert91 protocol for quantum key distribution using entangled photon pairs. For each photon pair we perform a random choice between key generation and a Bell inequality.…
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to…
Random number generation is a key technology that is useful in a variety of ways. Random numbers are often used to generate keys for data encryption. Random numbers generated at a sufficiently long length can encrypt sensitive data and make…
Motivated by the applications of secure multiparty computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum…
An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…
Two constructed prime number subsets (called prime brother & sisters and prime cousins) lead to a third one (called isolated primes) so that all three disjoint subsets together generate the prime number set. It should be suggested how the…
Unconditional security of the BB84 quantum key distribution protocol has been proved by exploiting the fundamental laws of quantum mechanics, but the practical quantum key distribution system maybe hacked by considering the imperfect state…