Zobrazeno 1 - 10
of 2 587
pro vyhledávání: '"Ryabko AN"'
Autor:
Ryabko, Boris
Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be encoded by
Externí odkaz:
http://arxiv.org/abs/2405.14570
Autor:
Ryabko, Boris
The problem of testing random number generators is considered and it is shown that an approach based on algorithmic information theory allows us to compare the power of different tests in some cases where the available methods of mathematical statist
Externí odkaz:
http://arxiv.org/abs/2404.02708
Suppose that females choose males based on attributes that do not signal any genetic quality that is not related to the choice itself. Can being choosy confer selective advantage in this situation? We introduce correlated strategies, which means that
Externí odkaz:
http://arxiv.org/abs/2309.15205
Autor:
Ryabko, Boris
Perfect ciphers have been a very attractive cryptographic tool ever since C. Shannon described them. Note that, by definition, if a perfect cipher is used, no one can get any information about the encrypted message without knowing the secret key. We
Externí odkaz:
http://arxiv.org/abs/2307.09735
Autor:
Zeninskaya, Natalia A.1 (AUTHOR) nataliazeninskaya@mail.ru, Ryabko, Alena K.1 (AUTHOR), Marin, Maksim A.1 (AUTHOR), Kombarova, Tatyana I.2 (AUTHOR), Shkuratova, Maria A.1 (AUTHOR), Rogozin, Methun M.1 (AUTHOR), Silkina, Marina V.1 (AUTHOR), Romanenko, Yana O.1 (AUTHOR), Ivashchenko, Tatiana A.1 (AUTHOR), Shemyakin, Igor G.1 (AUTHOR), Firstova, Victoria V.1 (AUTHOR)
Publikováno v:
Toxins. Jul2024, Vol. 16 Issue 7, p284. 14p.
Autor:
Ryabko, Boris
We consider the problem of constructing an unconditionally secure cipher with a short key for the case where the probability distribution of encrypted messages is unknown. Note that unconditional security means that an adversary with no computational
Externí odkaz:
http://arxiv.org/abs/2303.15258
Autor:
Ryabko, Boris
In 2002, Russell and Wang proposed a definition of entropically security that was developed within the framework of secret key cryptography. An entropically-secure system is unconditionally secure, that is, unbreakable, regardless of the enemy's comp
Externí odkaz:
http://arxiv.org/abs/2205.03890
Autor:
Ryabko, A. A.1 (AUTHOR) a.a.ryabko93@yandex.ru, Bobkov, A. A.1 (AUTHOR), Nalimova, S. S.1 (AUTHOR), Maksimov, A. I.1 (AUTHOR), Levitskii, V. S.2 (AUTHOR), Moshnikov, V. A.1 (AUTHOR), Terukov, E. I.1,2 (AUTHOR)
Publikováno v:
Technical Physics. 2023 Suppl 1, Vol. 68, pS13-S18. 6p.
Autor:
Ryabko, A. A.1,2 (AUTHOR) a.a.ryabko93@yandex.ru, Nalimova, S. S.1 (AUTHOR), Mazing, D. S.1 (AUTHOR), Korepanov, O. A.1 (AUTHOR), Guketlov, A. M.3 (AUTHOR), Aleksandrova, O. A.1 (AUTHOR), Maximov, A. I.1 (AUTHOR), Moshnikov, V. A.1 (AUTHOR), Shomakhov, Z. V.3 (AUTHOR), Aleshin, A. N.2 (AUTHOR)
Publikováno v:
Technical Physics. Nov2023, Vol. 68 Issue 11, p497-503. 7p.
Autor:
Ryabko, Boris
We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot obtain informa
Externí odkaz:
http://arxiv.org/abs/2112.10173