General quantum encryption scheme based on quantum memory

Marius Nagy, Dr. Naya Nagy a

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In cryptography, quantum information processing can be used to do much more than just key distribution. Simple quantum transformations augmented with the ability to store qubits in a quantum memory are the building blocks of a protocol allowing two parties to communicate secretly by encoding/decoding the exchanged message directly through quantum means, without the need to establish a secret encryption/decryption key first. Consequently, our quantum mechanical process of securely transmitting a message through a public channel is simpler, cleaner, faster and computationally more efficient than the two-step scenario with a quantum distributed classical key. The probability of catching a potential eavesdropper can be made arbitrarily large by increasing the length of the signature string attached to the message.

Original languageEnglish
Title of host publicationTheory and Practice of Natural Computing - Second International Conference, TPNC 2013, Proceedings
Pages169-180
Number of pages12
DOIs
StatePublished - 2013
Externally publishedYes
Event2nd International Conference on the Theory and Practice of Natural Computing, TPNC 2013 - Caceres, Spain
Duration: 3 Dec 20135 Dec 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8273 LNCS

Conference

Conference2nd International Conference on the Theory and Practice of Natural Computing, TPNC 2013
Country/TerritorySpain
CityCaceres
Period3/12/135/12/13

Keywords

  • bit rank
  • cryptography
  • eavesdropping
  • measurement
  • quantum gates
  • quantum memory
  • quantum protocol
  • security

Fingerprint

Dive into the research topics of 'General quantum encryption scheme based on quantum memory'. Together they form a unique fingerprint.

Cite this