Mikhail Anokhin

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 10

Top Topics

Computational Tools

Closely Related

Distributive Lattices

Top Venues

Groups Complex. Cryptol.

IACR Cryptol. ePrint Arch.

J. Math. Cryptol.

Publications

Mikhail Anokhin
There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups. CoRR (2023)
Mikhail Anokhin
Pseudo-free families and cryptographic primitives. J. Math. Cryptol. 16 (1) (2022)
Mikhail Anokhin
Pseudo-free families of computational universal algebras. J. Math. Cryptol. 15 (1) (2021)
Mikhail Anokhin
Pseudo-Free Families and Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2020 (2020)
Mikhail Anokhin
Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumption. Groups Complex. Cryptol. 11 (2) (2019)
Mikhail Anokhin
is weakly pseudo-free under the general integer factoring intractability assumption. Groups Complex. Cryptol. 10 (2) (2018)
Mikhail Anokhin
Pseudo-Free Families of Computational Universal Algebras. IACR Cryptol. ePrint Arch. 2018 (2018)
Mikhail Anokhin
Pseudo-free families of finite computationalelementary abelian p-groups. Groups Complex. Cryptol. 9 (1) (2017)
Mikhail Anokhin
A Certain Family of Subgroups of $\mathbb Z_n^\star$ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption. IACR Cryptol. ePrint Arch. 2017 (2017)
Mikhail Anokhin
Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups. IACR Cryptol. ePrint Arch. 2015 (2015)
Mikhail Anokhin
Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption. Groups Complex. Cryptol. 5 (1) (2013)
Mikhail Anokhin
Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumption. Electron. Colloquium Comput. Complex. 19 (2012)