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. By using chaotic switching between the two losing quantum games, we show that it is possible to achieve Parrondo's paradox involving a quantum walker playing two-sided quantum coin tossing games. Furthermore, we show 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.Received 24 February 2021Accepted 18 April 2021DOI:https://doi.org/10.1103/PhysRevResearch.3.L022019Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasControl & applications of chaosQuantum walksTechniquesChaos & nonlinear dynamicsStatistical PhysicsNonlinear Dynamics