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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






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


Probl. Peredachi Inf., 2015, Volume 51, Issue 1, Pages 90–95 (Mi ppi2165)  

This article is cited in 2 scientific papers (total in 2 papers)

Information Protection

The Vernam cipher is robust to small deviations from randomness

B. Ya. Ryabkoab

a Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia
b Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia

Abstract: The Vernam cipher, or one-time pad, plays an important role in cryptography because it is perfectly secure. In this cipher a key is a sequence of equiprobable independently generated symbols. We show that under small disturbance of these properties the obtained cipher is close to the Vernam cipher in the case where the enciphered plaintext and the key are generated by stationary ergodic sources.

Full text: PDF file (138 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2015, 51:1, 82–86

Bibliographic databases:

UDC: 621.391.1+65.012.8
Received: 07.04.2014
Revised: 25.11.2014

Citation: B. Ya. Ryabko, “The Vernam cipher is robust to small deviations from randomness”, Probl. Peredachi Inf., 51:1 (2015), 90–95; Problems Inform. Transmission, 51:1 (2015), 82–86

Citation in format AMSBIB
\Bibitem{Rya15}
\by B.~Ya.~Ryabko
\paper The Vernam cipher is robust to small deviations from randomness
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 1
\pages 90--95
\mathnet{http://mi.mathnet.ru/ppi2165}
\elib{http://elibrary.ru/item.asp?id=27042059}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 1
\pages 82--86
\crossref{https://doi.org/10.1134/S0032946015010093}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000352985900009}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84957942110}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2165
  • http://mi.mathnet.ru/eng/ppi/v51/i1/p90

    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

    This publication is cited in the following articles:
    1. A. P. U. Siahaan, “Vernam Conjugated Manipulation of BIT-Plane Complexity Segmentation”, Int. J. Secur. Appl., 11:9 (2017), 1–11  crossref  isi
    2. B. Ryabko, “Properties of two Shannon's ciphers”, Designs Codes Cryptogr., 86:5 (2018), 989–995  crossref  mathscinet  zmath  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:233
    Full text:50
    References:30
    First page:23

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