Classical leakage-resilient circuits from quantum fault-tolerant computation
Felipe Gomes Lacerda · 2015
Physical implementations of cryptographic algorithms leak information, which makes them vulnerable to so-called side-channel attacks.Cryptography is now used in an ever-increasing variety of scenarios, and the assumption that the execution of cryptosystems is physically insulated is often not realistic.The field of leakage resilience proposes to mitigate side-channel attacks by designing protocols that are secure even if information leaks during execution.In this work, we study leakage-resilient computation, which concerns the problem of performing secure universal computation in the presence of leakage.Fault-tolerant quantum computation is concerned with the problem of noise in quantum computers.Since it is very hard to insulate quantum systems from noise, fault tolerance proposes schemes for performing computations correctly even if some noise is present.It turns out that there exists a connection between leakage resilience and fault tolerance.In this work, we show that leakage in a classical circuit is a form of noise, when the circuit is interpreted as quantum.We then prove that for an arbitrary leakage model, there exists a corresponding noise model in which a circuit that is fault-tolerant against the noise model is also resilient against the given leakage model.We also show how to use constructions for fault tolerance to implement classical circuits that are secure in specific leakage models.This is done by establishing criteria in which quantum circuits can be converted into classical circuits in such a way that the leakage resilience property is preserved.Using these criteria, we convert an implementation of universal fault-tolerant quantum computation into a classical leakageresilient compiler, i.e., a scheme that compiles an arbitrary circuit into a circuit of the same functionality that is leakage-resilient.vi 4.9 (a): Circuito de codificação para |0 no código de Steane.O circuito que codifica |+ é o mesmo, com a diferença de que alvos e controles são revertidos, e estados |0 são revertidos em |+ e vice-versa.(b):