Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Anokhin Mikhail"'
Autor:
Anokhin Mikhail
Publikováno v:
Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 114-140 (2022)
In this article, we study the connections between pseudo-free families of computational Ω\Omega -algebras (in appropriate varieties of Ω\Omega -algebras for suitable finite sets Ω\Omega of finitary operation symbols) and certain standard cryptogra
Externí odkaz:
https://doaj.org/article/d43a0277a0d844c8ad68f7d7e6d2999c
Autor:
Anokhin Mikhail
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 197-222 (2020)
Let Ω be a finite set of finitary operation symbols. We initiate the study of (weakly) pseudo-free families of computational Ω-algebras in arbitrary varieties of Ω-algebras. A family (Hd | d ∈ D) of computational Ω-algebras (where D ⊆ {0, 1}*
Externí odkaz:
https://doaj.org/article/6015cfce4ff444d8b06215708cd83294
Autor:
Anokhin, Mikhail
Publikováno v:
Int. J. Algebra Comput., 34(4):471-490, 2024
Let $\Omega$ be a finite set of finitary operation symbols and let $\mathfrak V$ be a nontrivial variety of $\Omega$-algebras. Assume that for some set $\Gamma\subseteq\Omega$ of group operation symbols, all $\Omega$-algebras in $\mathfrak V$ are gro
Externí odkaz:
http://arxiv.org/abs/2302.10847
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Anokhin, Mikhail
Publikováno v:
Groups Complexity Cryptology; Nov2018, Vol. 10 Issue 2, p99-110, 12p
Autor:
Anokhin, Mikhail
Publikováno v:
Groups Complexity Cryptology; May2017, Vol. 9 Issue 1, p1-18, 18p
Autor:
Anokhin, Mikhail
Publikováno v:
Groups, Complexity, Cryptology; November 2018, Vol. 10 Issue: 2 p99-110, 12p
Autor:
Anokhin, Mikhail
Publikováno v:
Eastern-European Journal of Enterprise Technologies; 2014, Vol. 4 Issue 9, p33-37, 5p
Autor:
Anokhin, Mikhail
Publikováno v:
Groups Complexity Cryptology; May2013, Vol. 5 Issue 1, p53-74, 22p
Autor:
Anokhin, Mikhail
Publikováno v:
Groups Complexity Cryptology; Nov2019, Vol. 11 Issue 2, p133-134, 2p