1. Quantum cryptography How could you transmit information safety? Thanks to codes

2. Cryptography is everywhere  Credit card  Military secret  Internet communication (shopping, mails, …)  (…) The Enigma machine

3. Hackers too!! Every short of information could be captured

4. Contents : Why ‘quantum’ ? How does it works? And the hacker? Conclusion What is quantum cryptography ?

5. Some rules of quantum mechanic : every energy variation is quantified (e.g. allows production of single photon by exciting diamond with laser pulse); a measure (every type of measure!) on a system always disrupt it or destruct it (e.g. seeing is absorbing a photon); in quantum physic everything is probability, nothing is perfectly predictable. Why ‘quantum’ ? Looking a cylinder is like observing a quantum object. Where is this electron? (simulation)

6. How does it works ? A is sending to B a sequence of some thousand random bits coded on single photons by random polarization BA Polarization bases convention (‘code’ convention): circular (C) or linear (L) 10 10 LCRC V H Key code

7. B detection B randomize the polarization base to detect each photon and attribute a value to the bit thanks to the ‘code’ convention. BA UserSequence BitsA011001101Random key PolarizationACCLCLCCLL Random bases BLLLCCCCLC BitsB111011000Rough key

8. UserSequence BitsA011001101Random key PolarizationACCLCLCCLL Random bases BLLLCCCCLC BitsB111011000Rough key UserSequence BitsA011001101Random key PolarizationACCLCLCCLL Random bases BLLLCCCCLC BitsB111011000Rough key Measure errors detection and correction After transmission it subsists mistakes UserSequence BitsA011001101Random key PolarizationACCLCLCCLL Random bases BLLLCCCCLC BitsB111011000Rough key UserSequence BitsA011001101Random key PolarizationACCLCLCCLL Random bases BLLLCCCCLC BitsB111011000Rough key A and B compare their base choices sequence using a classical network and eliminate mistakes : reconciliation step. UserSequence BitsA10110Filtered key PolarizationALCCCL Same bases BLCCCL BitsB10100Filtered key

9. Transmission errors detection and correction A and B sacrifice a part of their filtered key to evaluate the transmission error ratio due to physical causes or to a hacker (or more!). UserSequence BitsA10110Filtered key PolarizationALCCCL Same bases BLCCCL BitsB10100Filtered key 1 C C 0 0 C C 0 OkERROR Confirmation step : if too much errors => start the process again Exchanged part

10. Last step : KEY CONSTRUCTION A and B use separately corrective algorithms to correct transmission errors and to amplify the confidentiality thanks to jamming the key. After that : only ONE key for A and B but WITHOUT TRANSMISSION of this one!

11. And the hacker ? BA The hacker could make many things…SO MANY!!....

12. The hacker could take information during transmissions. He could : During the first exchange : steal some photons during the first exchange; and/or (re)emit photons to mistake B; During the reconciliation step : read all the base choices of A and B; During the confirmation step : read all the sacrificed sequence; Hacker’s actions have many consequences : he must detect photons as the same way as B => he makes errors; he introduces more errors; he cannot control error rate; he haven't necessarily the same choices => he loses information whereas A and B no; he can’t do anything from this time! …BUT there is a price!!!

13. To get enough information, the hacker had introduced a non- negligible amount of errors and so he will be detected and… EVERYTHING WILL RESTART!!! And it’s even worst!!! And so, hacker is THE great looser!

14. Quantum cryptography is a good solution  Allows secure communication against hackers because everything is transmitted before creating the key.  Whatever the hacker want to do is against him. Thanks for your attention