Related papers: Qusicryslals in Vernam cipher
To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit…
We study the percolation of a quantum particle on quasicrystal lattices and compare it with the square lattice. For our study, we have considered quasicrystal lattices modelled on the pentagonally symmetric Penrose tiling and the…
We develop a method to design tunable quasiperiodic structures of particles suspended in a fluid by controlling standing acoustic waves. One application of our results is to ultrasound directed self-assembly, which allows fabricating…
We propose a new method for evaluating NISQ devices. This paper has three distinct parts. First, we present a new quantum algorithm that solves a two hundred year old problem of finding quadratic nonresidues (QNR) in polynomial time. We…
The previous work showed that the Y00 protocol could stay secure with the eavesdropper's guessing probability on the secret keys being strictly less than one under an unlimitedly long known-plaintext attack with quantum memory. However, an…
Exploring nonminimal-rank quasicrystals, which have symmetries that can be found in both periodic and aperiodic crystals, often provides new insight into the physical nature of aperiodic long-range order in models that are easier to treat.…
Aperiodic (quasicrystalline) tilings, such as Penrose's tiling, can be built up from e.g. kites and darts, squares and equilateral triangles, rhombi or shield shaped tiles and can have a variety of different symmetries. However, almost all…
We give a simple computational approach to mathematical quasicrystals, combining cut-and-project methods with self-similarity. Starting with a Pisot unit $\beta$ and an iterated function system $g_k(z)=\beta z +z_k, \ k=1,...,m$ in a…
It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
Cyber-security has become vital for modern networked control systems (NCS). In this paper, we propose that the emerging technology of quantum key distribution (QKD) can be applied to enhance the privacy and security of NCS up to an…
A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model…
I present a method for generating one-time pads from the digits of pi. Computer code is given to generate such pads from passphrases in a method having an extremely low probability (<10^-53) of a successful discovery of the one-time pads by…
Quantum secure direct communication is the direct communication of secret messages without first producing a shared secret key. It maybe used in some urgent circumstances. Here we propose a quantum secure direct communication protocol using…
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary…
The discovery of quasicrystals has changed our view of some of the most basic notions related to the condensed state of matter. Before the age of quasicrystals, it was believed that crystals break the continuous translation and rotation…
Discovering functional crystalline materials through computational methods remains a formidable challenge in materials science. Here, we introduce VQCrystal, an innovative deep learning framework that leverages discrete latent…
The weakness of the vigenere cipher lies in its short key and is repeated, so there is a key loop in encrypting messages, this is used by cryptanalysts using the Kasiski method to know the key length so it can solve this algorithm. The…
We consider the scenario where Alice wants to send a secret (classical) $n$-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to…
We revisit the 3-pass code-based identification scheme proposed by Stern at Crypto'93, and give a new 5-pass protocol for which the probability of the cheater is 1/2 (instead of 2/3 in the original Stern's proposal). Furthermore, we propose…