RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Pis'ma v Zh. Èksper. Teoret. Fiz.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Pis'ma v Zh. Èksper. Teoret. Fiz., 2016, Volume 103, Issue 5, Pages 389–393 (Mi jetpl4887)  

QUANTUM INFORMATION SCIENCE

On the complexity of search for keys in quantum cryptography

S. N. Molotkovabc

a Institute of Solid State Physics, Russian Academy of Sciences, Chernogolovka, Moscow region, 142432, Russia
b Academy of Cryptography of the Russian Federation, Moscow, 121552, Russia
c Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

Abstract: The trace distance is used as a security criterion in proofs of security of keys in quantum cryptography. Some authors doubted that this criterion can be reduced to criteria used in classical cryptography. The following question has been answered in this work. Let a quantum cryptography system provide an $\varepsilon$-secure key such that $\frac{1}{2}|| \rho_{XE}-\rho_U\otimes \rho_E ||_1<\varepsilon$, which will be repeatedly used in classical encryption algorithms. To what extent does the $\varepsilon$-secure key reduce the number of search steps (guesswork) as compared to the use of ideal keys? A direct relation has been demonstrated between the complexity of the complete consideration of keys, which is one of the main security criteria in classical systems, and the trace distance used in quantum cryptography. Bounds for the minimum and maximum numbers of search steps for the determination of the actual key have been presented.

DOI: https://doi.org/10.7868/S0370274X16050118

Full text: PDF file (173 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Journal of Experimental and Theoretical Physics Letters, 2016, 103:5, 345–349

Bibliographic databases:

Document Type: Article
Received: 02.11.2015
Revised: 18.01.2016

Citation: S. N. Molotkov, “On the complexity of search for keys in quantum cryptography”, Pis'ma v Zh. Èksper. Teoret. Fiz., 103:5 (2016), 389–393; JETP Letters, 103:5 (2016), 345–349

Citation in format AMSBIB
\Bibitem{Mol16}
\by S.~N.~Molotkov
\paper On the complexity of search for keys in quantum cryptography
\jour Pis'ma v Zh. \`Eksper. Teoret. Fiz.
\yr 2016
\vol 103
\issue 5
\pages 389--393
\mathnet{http://mi.mathnet.ru/jetpl4887}
\crossref{https://doi.org/10.7868/S0370274X16050118}
\elib{http://elibrary.ru/item.asp?id=26184390}
\transl
\jour JETP Letters
\yr 2016
\vol 103
\issue 5
\pages 345--349
\crossref{https://doi.org/10.1134/S002136401605009X}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000376597300011}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84971016536}


Linking options:
  • http://mi.mathnet.ru/eng/jetpl4887
  • http://mi.mathnet.ru/eng/jetpl/v103/i5/p389

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  •       Pis'ma v Zhurnal ksperimental'noi i Teoreticheskoi Fiziki
    Number of views:
    This page:81
    References:37
    First page:36

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018