Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2016, Issue 9, Pages 68–70
DOI: https://doi.org/10.17223/2226308X/9/27
(Mi pdma294)
 

Mathematical Methods of Cryptography

Applications of two-faced processes to pseudorandom number generation

B. Ya. Ryabko

Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
References:
Abstract: Random and pseudorandom number generators (RNG and PRNG) are used for many purposes including cryptographic applications. For such applications, a generated bit sequence should mimic true random, i.e., by definition, such a sequence could be interpreted as the result of the flips of a “fair” coin with sides that are labelled 0 and 1. It is known that the Shannon entropy of this process is 1 per letter, whereas for any other stationary process with binary alphabet the Shannon entropy is strictly less than 1. On the other hand, the entropy of the PRNG output should be much less than 1 bit (per letter), but the output sequence should look like truly random. We describe random processes, for which those, in a first glance contradictory, properties are valid. More precisely, it is shown that there exist binary-alphabet random processes whose entropy is less than 1 bit (per letter), but a frequency of occurrences of any word $u$ goes to $2^{-|u|}$, where $|u|$ is the length of $u$. In turn, it gives a possibility to construct RNG and PRNG, which possess theoretical guarantees. This is important for applications of them in cryptography.
Keywords: random number generator, pseudorandom number generator, Shannon entropy.
Funding agency Grant number
Russian Foundation for Basic Research 15-29-07932
Document Type: Article
UDC: 519.722
Language: Russian
Citation: B. Ya. Ryabko, “Applications of two-faced processes to pseudorandom number generation”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 68–70
Citation in format AMSBIB
\Bibitem{Rya16}
\by B.~Ya.~Ryabko
\paper Applications of two-faced processes to pseudorandom number generation
\jour Prikl. Diskr. Mat. Suppl.
\yr 2016
\issue 9
\pages 68--70
\mathnet{http://mi.mathnet.ru/pdma294}
\crossref{https://doi.org/10.17223/2226308X/9/27}
Linking options:
  • https://www.mathnet.ru/eng/pdma294
  • https://www.mathnet.ru/eng/pdma/y2016/i9/p68
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024