Perfect secrecy cryptography via mixing of chaotic waves in irreversible time-varying silicon chips
Abstract
Protecting confidential data is a major worldwide challenge. Classical cryptography is fast and scalable, but its broken by quantum algorithms. Quantum cryptography is unclonable, but requires quantum installations that are more expensive, slower, and less scalable than classical optical networks. Here we show a perfect secrecy cryptography in classical optical channels. The system exploits correlated chaotic wavepackets, which are mixed in inexpensive and CMOS compatible silicon chips. The chips can generate 0:1 Tbit of different keys for every mm of length of the input channel, and require the transmission of an amount of data that can be as small as 1/1000 of the message’s length. We discuss the security of this protocol for an attacker with unlimited technological power, and who can access the system copying any of its part, including the chips. The second law of thermodynamics and the exponential sensitivity of chaos unconditionally protect this scheme against any possible attack.
Citation
Di Falco , A , Mazzone , V , Cruz , A & Fratalocchi , A 2019 , ' Perfect secrecy cryptography via mixing of chaotic waves in irreversible time-varying silicon chips ' , Nature Communications , vol. 10 , 5827 . https://doi.org/10.1038/s41467-019-13740-y
Publication
Nature Communications
Status
Peer reviewed
ISSN
2041-1723Type
Journal article
Rights
Copyright © The Author(s) 2019. Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
Description
A.D.F. acknowledges support from EPSRC (EP/L017008/1). A.F. acknowledges support from KAUST (OSR-2016-CRG5-2995). The research data underpinning this publication can be accessed at https://doi.org/10.17630/19156fc3-cc1f-4ee3-b553-f02042cf89a0.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.