The goal of this talk is to present an introduction to quantum computing for non-specialists. I will first present the quantum computing model in order to have a first feel of what we can and cannot do with a quantum computer. Then I will present a few iconic quantum algorithms such as Grover’s algorithm and Shor’s algorithm. Finally, I will talk about perspectives relative to quantum-secure cryptography. During the talk, I will also briefly talk about error correction for quantum computation and quantum cryptography.
The thesis deals with a subfield of cryptography called secure multi-party computation which is a technique that allows multiple parties to work together to compute a single function while preserving the privacy of it's inputs. More specifically, the thesis deals with secure multi-party computation over the ring of integers modulo pk . The thesis begins with an introduction of the general principle of secure multi-party protocols, followed by the construction of the necessary theoretical groundwork over commutative rings, wich will be needed to describe and understand a specific protocol in the last section of the thesis. 1