Use of Quantum Parond Random Walk for Encryption

Credit: CC0 public domain

Assistant Professor Kang Hao Chung of the Singapore Institute of Technology (SUTD) and his research team set out to apply a concept from the quantum parond paradox in search of a practical protocol for semiclassical encryption.recently Physical Review Study In the letter, the team published a treatise entitled “Quantum Coin Parond Game Chaos Switching with Cryptographic Applications”, and the basic idea and behavior of quantum coin parond game chaos switching is similar to cryptography. I discovered that I have dynamics.

Parondo’s paradox is a phenomenon in which switching between two losing games results in a win.With a double-sided quantum coin toss game Introduced by the author, in their previous work, they randomly and regularly throw two quantum coins to change the expected position of the quantum walker from a losing position to a fair position and a winning position, respectively. Showed that it can be done. In such games, the Quantum Walker is given a set of instructions on how to move depending on the outcome of the Quantum coin toss.

Inspired by the underlying principles of this quantum game, Joel Lai, lead author of SUTD’s research, explains: coin Since Toss knows the initial position, can you tell me the sequence of Toss that leads to this final result? After all, this task can be very difficult or very easy. Rye added: It is almost impossible to determine the sequence of toss that leads to the final result. However, in the case of periodic toss, the periodic sequence is structured and deterministic, so it is fairly easy to get the sequence of toss. “

Random sequences are too uncertain, but periodic sequences are deterministic. This gave rise to the idea of ​​incorporating chaos sequences as a means of performing switching. The authors have found that using chaos switching via a pre-generated chaos sequence can significantly enhance the work. For observers who do not know some of the information needed to generate a chaotic sequence, decoding a toss sequence is similar to determining a random sequence. However, for agents that have information on how to generate a chaotic sequence, this is similar to a periodic sequence. According to the author, this information about the generation of chaotic sequences is likened to an encryption key. Since we only know the key and the final result (that is, the encrypted message), we can invert this result to get the original state of the Quantum Walker (that is, the original message).

Assistant Professor Chung, a senior author of the study, said: “The introduction of chaos switching, when combined with the Parondo paradox, extends the application of the Parondo paradox from just mathematical tools used in quantum information to classify or discriminate between initial and final states. “The development of a fully implementable quantum chaos paradox game may bring advances that improve our semi-classical framework and bridge some of the problems still facing quantum cryptography. “He added.

Parondo paradox with three-sided coins

For more information:
Joel Weijia Lai et al, Quantum Coin Parondo Game Chaos Switching with Cryptographic Applications, Physical Review Study (2021). DOI: 10.1103 / PhysRevResearch.3.L022019

Quote: Use Quantum Parond Random Walk for encryption (October 15, 2021) October 15, 2021 Get

This document is subject to copyright. No part may be reproduced without written permission, except for fair transactions for personal investigation or research purposes. The content is provided for informational purposes only.

Use of Quantum Parond Random Walk for Encryption

Source link Use of Quantum Parond Random Walk for Encryption

Show More

Related Articles

Back to top button