Secure Quantum Data Communications Using Classical Keying Material
We put together recent results on quantum cryptography and random generation of quantum operators. In a synthetic way, we review the work on quantum message authentication by Aharonov et al. and Broadbent and Wainewright. We also outline the work on asymmetric and symmetric-key encryption of Alagic et al. and St-Jules. Quantum operators, i.e., Cliffords and Paulis, play the role of keys in their work. Using the work of Koenig and Smolin on the generation of symplectics, we examine how classical key material, i.e., classical bits, can mapped to quantum operators. We propose a classical key mapping to quantum operators used in quantum cryptography. It is a classical cryptography interface to quantum data cryptography. The main advantage is that classical random key generation techniques can be used to produce keys for quantum data cryptography.
KeywordsQuantum information Quantum data Quantum communications Quantum cryptography Clifford Pauli Symplectic
I would like to thank my colleague Prof. Evangelos Kranakis for his advice on some aspects of this paper. This work was partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).
- 1.Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations of Computer Science, pp. 453–469 (2010)Google Scholar
- 2.Alagic, G., Broadbent, A., Fefferman, B., Gagliardoni, T., Schaffner, C., Jules, M.S.: Computational security of quantum encryption. In: 9th International Conference on Information Theoretic Security (ICITS) (2016)Google Scholar
- 7.Broadbent, A., Wainewright, E.: Efficient simulation for quantum message authentication. In: 9th International Conference on Information Theoretic Security (ICITS) (2016)Google Scholar
- 8.Chevalley, C.: Theory of Lie Group. Dover Publications, Mineola (2018)Google Scholar
- 12.Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 25–32. ACM, New York (1989)Google Scholar
- 15.St-Jules, M.: Secure quantum encryption. Master’s thesis, School of Graduate Studies and Research, University of Ottawa, Ottawa, Ontario, Canada, November 2016Google Scholar
- 16.Wainewright, E.: Efficient simulation for quantum message authentication. Master’s thesis, Faculty of Graduate and Postgraduate Studies, University of Ottawa, Ottawa, Ontario, Canada (2016)Google Scholar