Mikhail Anokhin

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups.
CoRR
Mikhail Anokhin
2024 J jnl
There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups.
Int. J. Algebra Comput.
Mikhail Anokhin
2023 J jnl
There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups.
CoRR
Mikhail Anokhin
2022 J jnl
Pseudo-free families and cryptographic primitives.
J. Math. Cryptol.
Mikhail Anokhin
2021 J jnl
Pseudo-free families of computational universal algebras.
J. Math. Cryptol.
Mikhail Anokhin
2020 J jnl
Pseudo-Free Families and Cryptographic Primitives.
IACR Cryptol. ePrint Arch.
Mikhail Anokhin
2019 J jnl
Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumption.
Groups Complex. Cryptol.
Mikhail Anokhin
2018 J jnl
A certain family of subgroups of ℤ
Groups Complex. Cryptol.
Mikhail Anokhin
2018 J jnl
Pseudo-Free Families of Computational Universal Algebras.
IACR Cryptol. ePrint Arch.
Mikhail Anokhin
2017 J jnl
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.
Mikhail Anokhin
2017 J jnl
Pseudo-free families of finite computationalelementary abelian p-groups.
Groups Complex. Cryptol.
Mikhail Anokhin
2015 J jnl
Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups.
IACR Cryptol. ePrint Arch.
Mikhail Anokhin
2013 J jnl
Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption.
Groups Complex. Cryptol.
Mikhail Anokhin
2012 J jnl
Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumption.
Electron. Colloquium Comput. Complex.
Mikhail Anokhin