Advertisement

Secure Quantum Data Communications Using Classical Keying Material

  • Michel BarbeauEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11413)

Abstract

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.

Keywords

Quantum information Quantum data Quantum communications Quantum cryptography Clifford Pauli Symplectic 

Notes

Acknowledgements

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).

References

  1. 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. 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
  3. 3.
    Bennett, C., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.: Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bolt, B., Room, T.G., Wall, G.E.: On the Clifford collineation, transform and similarity groups. I. J. Aust. Math. Soc. 2(1), 60–79 (1961)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bolt, B., Room, T.G., Wall, G.E.: On the Clifford collineation, transform and similarity groups. II. J. Aust. Math. Soc. 2(1), 80–96 (1961)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Briegel, H.J., Dür, W., Cirac, J.I., Zoller, P.: Quantum repeaters: the role of imperfect local operations in quantum communication. Phys. Rev. Lett. 81, 5932–5935 (1998)CrossRefGoogle Scholar
  7. 7.
    Broadbent, A., Wainewright, E.: Efficient simulation for quantum message authentication. In: 9th International Conference on Information Theoretic Security (ICITS) (2016)Google Scholar
  8. 8.
    Chevalley, C.: Theory of Lie Group. Dover Publications, Mineola (2018)Google Scholar
  9. 9.
    Diaconis, P., Shahshahani, M.: The subgroup algorithm for generating uniform random variables. Probab. Eng. Inf. Sci. 1(1), 15–32 (1987)CrossRefGoogle Scholar
  10. 10.
    Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Gallian, J.: Contemporary Abstract Algebra, 8th edn. Cengage Learning - Brooks/Cole, Boston (2006)zbMATHGoogle Scholar
  12. 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
  13. 13.
    Koenig, R., Smolin, J.: How to efficiently select an arbitrary Clifford group element. J. Math. Phys. 55, 122202 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)CrossRefGoogle Scholar
  15. 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. 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

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations