Using Quantum Parrondo’s Random Walks for Encryption

14 Oct 2021 Science, Mathematics and Technology Algorithms, Computing, Software Engineering, System Security, Theory

SUTD - Joel Lai and Kang Hao Cheong

Assistant Professor Kang Hao Cheong and his research team from the Singapore University of Technology and Design (SUTD) have set out to apply concepts from quantum Parrondo’s paradox in search of a working protocol for semiclassical encryption. In a recent Physical Review Research letter, the team published the paper 'Chaotic switching for quantum coin Parrondo's games with application to encryption' and discovered that chaotic switching for quantum coin Parrondo's games has similar underlying ideas and working dynamics to encryption.

Parrondo’s paradox is a phenomenon where the switching of two losing games results in a winning outcome. In the two-sided quantum coin tossing game introduced by the authors, they showed in a previous work that random and certain periodic tossing of two quantum coins can turn a quantum walker’s expected position from a losing position into a fair and winning position, respectively. In such a game, 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, the lead author of the study from SUTD explained, “Suppose I present to you the outcome of the quantum walker at the end of 100 coin tosses, knowing the initial position, can you tell me the sequence of tosses that lead to this final outcome?” As it turns out, this task can either be very difficult or very easy. Lai added: “In the case of random switching, it is almost impossible to determine the sequence of tosses that lead to the end result. However, for periodic tossing, we could get the sequence of tosses rather easily, because a periodic sequence has structure and is deterministic”.

Random sequences have too much uncertainty, on the other hand, periodic sequences are deterministic. This led to the idea of incorporating chaotic sequences as a means to perform the switching. The authors discovered that using chaotic switching through a pre-generated chaotic sequence significantly enhances the work. For an observer who does not know parts of the information required to generate the chaotic sequence, deciphering the sequence of tosses is analogous to determining a random sequence. However, for an agent with information on how to generate the chaotic sequence, this is analogous to a periodic sequence. According to the authors, this information on generating the chaotic sequence is likened to the keys in encryption. Knowing just the keys and the final outcome (i.e. the encrypted message), this outcome can be inverted to obtain the original state of the quantum walker (i.e. the original message).

Assistant Professor Cheong, the senior author of the study remarked, “The introduction of chaotic switching, when combined with Parrondo’s paradox, extends the application of Parrondo’s paradox from simply a mathematical tool used in quantum information for classification or identification of the initial state and final outcome to one that has real-world engineering applications. Cheong added, “The development of a fully implementable quantum chaotic Parrondo’s game may also improve on our semiclassical framework and provide advances to bridge some of the problems still faced in quantum encryption”.

Acknowledgements:
This project was funded by the Singapore University of Technology and Design Grant No. SRG SCI 2019 142.

Reference:
Chaotic switching for quantum coin Parrondo's games with application to encryption, Physical Review Research. (DOI: 10.1103/PhysRevResearch.3.L022019