We stand with Ukraine

We stand with Ukraine

Boris Ryabko

Orcid: 0000-0002-7232-9644

Affiliations:

Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia

According to our database¹, Boris Ryabko authored at least 120 papers between 1981 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on mathnet.ru

On csauthors.net:

Bibliography

2025

Perfect message authentication codes are robust to small deviations from uniform key distributions.

[BibT_eX]

[DOI]

CoRR, August, 2025

A General Method for the Development of Constrained Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2025

2024

Linear hash functions and their applications to error detection and correction.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., August, 2024

Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory.

[BibT_eX]

[DOI]

Entropy, June, 2024

Building test batteries based on analysing random number generator tests within the framework of algorithmic information theory.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Reduction of the secret key length in the perfect cipher by data compression and randomisation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Unconditionally secure ciphers with a short key for a source with unknown statistics.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Unconditionally secure short key ciphers based on data compression and randomization.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2023

2022

Information-Theoretic Method for Assessing the Quality of Translations.

[BibT_eX]

[DOI]

,

Nadezhda Savina

Entropy, December, 2022

Entropically secure cipher for messages generated by Markov chains with unknown statistics.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Using data compression and randomisation to build an unconditionally secure short key cipher.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

2021

A Pseudo-Random Generator Whose Output is a Normal Sequence.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Using data compression and randomization to build an unconditionally secure short key cipher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Using Data Compression to Build a Method for Statistically Verified Attribution of Literary Texts.

[BibT_eX]

[DOI]

,

Nadezhda Savina

Entropy, 2021

Fast direct access to variable length codes.

[BibT_eX]

[DOI]

CoRR, 2021

Calibrating random number generator tests.

[BibT_eX]

[DOI]

CoRR, 2021

Construction of a pseudo-random number generator whose output is a normal sequence.

[BibT_eX]

[DOI]

,

Viacheslav Zhuravlev

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Development of an information-theoretical method of attribution of literary texts.

[BibT_eX]

[DOI]

,

Nadezhda Savina

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Application of algorithmic information theory to calibrate tests of random number generators.

[BibT_eX]

[DOI]

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Cryptography in the Information Society

[BibT_eX]

[DOI]

,

WorldScientific, ISBN: 9789811226175, 2021

2020

Application of the Computer Capacity to the Analysis of Processors Evolution.

[BibT_eX]

[DOI]

,

Anton Rakitskiy

J. Circuits Syst. Comput., 2020

Time-Adaptive Statistical Test for Random Number Generators.

[BibT_eX]

[DOI]

Entropy, 2020

Information Theory as a Means of Determining the Main Factors Affecting the Processors Architecture.

[BibT_eX]

[DOI]

Anton Rakitskiy

,

CoRR, 2020

The time-adaptive statistical testing for random number generators.

[BibT_eX]

[DOI]

CoRR, 2020

Statistical Testing of Randomness.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

The time-adaptive statistical testing for random number generators.

[BibT_eX]

[DOI]

,

Viacheslav Zhuravlev

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019

On asymptotically optimal tests for random number generators.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Using the Data-Compression Method for Studying Hunting Behavior in Small Mammals.

[BibT_eX]

[DOI]

Zhanna Reznikova

,

,

Sofia Panteleeva

,

Anna Novikovskaya

,

,

Natalia Feoktistova

,

,

Alexey S. Matveev

Entropy, 2019

Application of data compression techniques to time series forecasting.

[BibT_eX]

[DOI]

K. S. Chirikhin

,

CoRR, 2019

Time-Universal Data Compression.

[BibT_eX]

[DOI]

Algorithms, 2019

Gradient Cryptanalysis of Block Cipher CHAM 64/128.

[BibT_eX]

[DOI]

,

Alexander Soskov

,

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Computer Capacity As a Tool For the Processors Development Analysis.

[BibT_eX]

[DOI]

Anton Rakitskiy

,

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Time-universal data compression and prediction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Linear Hash Functions as a Means of Distortion-Rate Optimization in Data Embedding.

[BibT_eX]

[DOI]

,

Proceedings of the ACM Workshop on Information Hiding and Multimedia Security, 2019

2018

Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2018

Theoretical Approach to Performance Evaluation of Supercomputers.

[BibT_eX]

[DOI]

,

Anton Rakitskiy

J. Circuits Syst. Comput., 2018

The distinguishing attack on Speck, Simon, Simeck, HIGHT and LEA.

[BibT_eX]

[DOI]

,

Aleksandr Soskov

IACR Cryptol. ePrint Arch., 2018

Properties of two Shannon's ciphers.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Investigation of the Processors Evolution Using the Computer Capacity.

[BibT_eX]

[DOI]

,

Anton Rakitskiy

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017

Information-Theoretic method for classification of texts.

[BibT_eX]

[DOI]

,

,

Irina Selivanova

Probl. Inf. Transm., 2017

An Analytic Method for Estimating the Computation Capacity of Computing Devices.

[BibT_eX]

[DOI]

,

Anton Rakitskiy

J. Circuits Syst. Comput., 2017

Using data-compressors for statistical analysis of problems on homogeneity testing and classification.

[BibT_eX]

[DOI]

,

,

Irina Selivanova

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Time series prediction based on data compression methods.

[BibT_eX]

[DOI]

,

Probl. Inf. Transm., 2016

Information-Theoretical Analysis of Two Shannon's Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Compression-Based Methods of Statistical Analysis and Prediction of Time Series

[BibT_eX]

[DOI]

,

,

Mikhail Malyutov

Springer, ISBN: 978-3-319-32253-7, 2016

2015

Complexity of Approximating Functions on Real-Life Computers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Two-faced processes and existence of RNG with proven properties.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Two-faced processes and random number generators.

[BibT_eX]

[DOI]

CoRR, 2015

Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible.

[BibT_eX]

[DOI]

,

Proceedings of the IEEE International Symposium on Information Theory, 2015

2013

Using Ideas of Kolmogorov Complexity for Studying Biological Texts.

[BibT_eX]

[DOI]

,

Zhanna Reznikova

,

Alexey Druzyaka

,

Sofia Panteleeva

Theory Comput. Syst., 2013

The Vernam cipher is robust to small deviations from randomness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Using Information Theory to Study the Efficiency and Capacity of Caching in the Computer Networks.

[BibT_eX]

[DOI]

CoRR, 2013

2012

An information-theoretic approach to estimate the capacity of processing units.

[BibT_eX]

[DOI]

Perform. Evaluation, 2012

On the efficiency and capacity of computers.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

Constructing perfect steganographic systems.

[BibT_eX]

[DOI]

,

Inf. Comput., 2011

Experimental Investigation of Forecasting Methods Based on Universal Measures

[BibT_eX]

[DOI]

,

Pavel Pristavka

CoRR, 2011

Confidence sets in time-series filtering.

[BibT_eX]

[DOI]

,

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Nonparametric statistical inference for ergodic processes.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2010

Fast enumeration algorithm for words with given constraints on run lengths of ones.

[BibT_eX]

[DOI]

Yulia S. Medvedeva

,

Probl. Inf. Transm., 2010

Using Information Theory to Study Efficiency and Capacity of Computers and Similar Devices.

[BibT_eX]

[DOI]

Inf., 2010

2009

Compression-based methods for nonparametric prediction and estimation of some characteristics of time series.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Asymptotically optimal perfect steganographic systems.

[BibT_eX]

[DOI]

,

Probl. Inf. Transm., 2009

The Use of Ideas of Information Theory for Studying "Language" and Intelligence in Ants.

[BibT_eX]

[DOI]

,

Zhanna Reznikova

Entropy, 2009

Application of information-theoretic tests for the analysis of DNA sequences based on Markov chain models.

[BibT_eX]

[DOI]

Natalya Usotskaya

,

Comput. Stat. Data Anal., 2009

Using Kolmogorov complexity for understanding some limitations on steganography.

[BibT_eX]

[DOI]

,

Proceedings of the IEEE International Symposium on Information Theory, 2009

Fast enumeration of run-length-limited words.

[BibT_eX]

[DOI]

,

Yulia S. Medvedeva

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets.

[BibT_eX]

[DOI]

,

,

IEEE Trans. Inf. Theory, 2008

Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms

[BibT_eX]

[DOI]

CoRR, 2008

Applications of Universal Source Coding to Statistical Analysis of Time Series

[BibT_eX]

[DOI]

CoRR, 2008

Testing Statistical Hypotheses About Ergodic Processes

[BibT_eX]

[DOI]

,

CoRR, 2008

DNA-sequence analysis using Markov chain models.

[BibT_eX]

[DOI]

,

Natalie Usotskaya

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

On hypotheses testing for ergodic processes.

[BibT_eX]

[DOI]

,

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007

Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

Fast Recursive Coding Based on Grouping of Symbols

[BibT_eX]

[DOI]

Nikolay N. Ponomarenko

,

Vladimir V. Lukin

,

Karen O. Egiazarian

,

,

CoRR, 2007

Information-Theoretic Approach to Steganographic Systems.

[BibT_eX]

[DOI]

,

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Provably Secure Universal Steganographic Systems.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2006

The experimental distinguishing attack on RC4.

[BibT_eX]

[DOI]

Sergey Doroshenko

,

IACR Cryptol. ePrint Arch., 2006

On ZK-Crypt, Book Stack, and Statistical Tests.

[BibT_eX]

[DOI]

Sergey Doroshenko

,

,

,

,

IACR Cryptol. ePrint Arch., 2006

Universal Codes as a Basis for Time Series Testing

[BibT_eX]

[DOI]

,

CoRR, 2006

Fast Enumeration of Combinatorial Objects

[BibT_eX]

[DOI]

CoRR, 2006

Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series..

[BibT_eX]

[DOI]

,

,

Proceedings of the Kolmogorov Complexity and Applications, 29.01. - 03.02.2006, 2006

2005

A New Type of Attacks on Block Ciphers.

[BibT_eX]

[DOI]

,

,

Probl. Inf. Transm., 2005

Experimental investigation of forecasting methods based on data compression algorithms.

[BibT_eX]

[DOI]

,

Probl. Inf. Transm., 2005

Prediction of Large Alphabet Processes and Its Application to Adaptive Source Coding

[BibT_eX]

[DOI]

,

CoRR, 2005

Universal codes as a basis for nonparametric testing of serial independence for time series.

[BibT_eX]

[DOI]

,

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Basics of Contemporary Cryptography for IT Practitioners

[BibT_eX]

[DOI]

,

Series on Coding Theory and Cryptology 1, WorldScientific, ISBN: 978-981-4479-85-1, 2005

2004

Coding combinatorial sources with costs.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2004

"Book Stack" as a New Statistical Test for Random Numbers.

[BibT_eX]

[DOI]

,

Andrey Pestunov

Probl. Inf. Transm., 2004

Using universal coding approach to randomness testing.

[BibT_eX]

[DOI]

,

,

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Prediction and adaptive coding of sources with large or infinite alphabet.

[BibT_eX]

[DOI]

,

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Fast Codes for Large Alphabet Sources and Its Application to Block Encoding.

[BibT_eX]

[DOI]

,

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Adaptive Coding and Prediction of Sources with Large and Infinite Alphabet.

[BibT_eX]

[DOI]

,

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Universal Coding of Function Spaces as a Model for Signal Compression.

[BibT_eX]

[DOI]

,

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Adaptive χ<sup>2</sup> Test for Discriminating between Close Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems.

[BibT_eX]

[DOI]

,

V. S. Stognienko

,

Probl. Inf. Transm., 2003

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions.

[BibT_eX]

[DOI]

,

IEEE Commun. Lett., 2003

Using Information Theory Approach to Randomness Testing.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2003

Fast codes for large alphabets.

[BibT_eX]

[DOI]

,

,

Karen O. Egiazarian

Commun. Inf. Syst., 2003

The fast algorithm for the block codes and its application to image compression.

[BibT_eX]

[DOI]

,

,

Karen O. Egiazarian

,

Proceedings of the 2003 International Conference on Image Processing, 2003

2002

An Efficient Generation Method for Uniformly Distributed Random Numbers.

[BibT_eX]

[DOI]

,

Elena Matchikina

Probl. Inf. Transm., 2002

On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources.

[BibT_eX]

[DOI]

,

Flemming Topsøe

J. Complex., 2002

Adaptive chi-square test and its application to some cryptographic problems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

2001

The estimated cost of a search tree on binary words.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2001

The simple ideal cipher system.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

The nonprobabilistic approach to learning the best prediction.

[BibT_eX]

[DOI]

Electron. Trans. Artif. Intell., 2001

A Study of Ants' Numerical Competence.

[BibT_eX]

[DOI]

Zhanna Reznikova

,

Electron. Trans. Artif. Intell., 2001

2000

Fast and efficient construction of an unbiased random sequence.

[BibT_eX]

[DOI]

,

Elena Matchikina

IEEE Trans. Inf. Theory, 2000

1999

Fast coding of low-entropy sources.

[BibT_eX]

[DOI]

,

Marina P. Sharova

IEEE Trans. Inf. Theory, 1999

Efficient homophonic coding.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 1999

Fast and Space-Efficient Adaptive Arithmetic Coding.

[BibT_eX]

[DOI]

,

Proceedings of the Cryptography and Coding, 1999

1997

Homophonic Coding with Logarithmic Memory Size.

[BibT_eX]

[DOI]

,

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Using Shannon entropy and Kolmogorov complexity to study the communicative system and cognitive capacities in ants.

[BibT_eX]

[DOI]

,

Zhanna Reznikova

Complex., 1996

A Fast and Efficient Homophonic Coding Algorithm.

[BibT_eX]

[DOI]

,

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1994

Fast and efficient coding of information sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

The Complexity and Effectiveness of Prediction Algorithms.

[BibT_eX]

[DOI]

J. Complex., 1994

1992

A fast on-line adaptive code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

1985

Universal retrieval trees.

[BibT_eX]

[DOI]

R. E. Krichevsky

,

Discret. Appl. Math., 1985

1981

Comments on 'A source matching approach to finding minimax codes' by L. D. Davisson and A. Leon-Garcia.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

Optimal key for taxons ordered in accordance with their frequencies.

[BibT_eX]

[DOI]

R. E. Krichevskii

,

,

A. Yu. Haritonov

Discret. Appl. Math., 1981

Loading...