Mikhail Anokhin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups International Journal of Algebra and Computation	2024-07-16	Paper
Pseudo-free families and cryptographic primitives Journal of Mathematical Cryptology	2022-07-19	Paper
Pseudo-free families of computational universal algebras Journal of Mathematical Cryptology	2021-06-17	Paper
Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption Groups - Complexity - Cryptology	2020-05-11	Paper
A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption Groups - Complexity - Cryptology	2019-08-08	Paper
Pseudo-free families of finite computational elementary abelian \(p\)-groups Groups - Complexity - Cryptology	2017-05-03	Paper
Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption Groups, Complexity, Cryptology	2014-01-23	Paper

Research outcomes over time

This page was built for person: Mikhail Anokhin