Using quantum Parrondo’s random walks for encryption

Phys.org   October 15, 2021
Quantum game theory has stimulated some interest in recent years with the advancement of quantum information theory. This interest has led to a resurgence of quantum Parrondo’s games. With two losing games combining to give a winning game, this paradoxical idea is known as Parrondo’s paradox. Researchers in Singapore used chaotic switching between the two losing quantum games, to show that it is possible to achieve Parrondo’s paradox involving a quantum walker playing two-sided quantum coin tossing games. They showed that the framework of chaotic switching in quantum coin tosses can be applied to encryption. This is a proposal to deploy a quantum coin toss with chaotic switching for semiclassical encryption…read more. Open Access TECHNICAL ARTICLE 

General schematic of how Parrondo’s chaotic switching in quantum coin toss games can be applied to encryption… Credit: Phys. Rev. Research 3, L022019, 2 June 2021 

Posted in Encryption and tagged , , .

Leave a Reply