Mikhail Anokhin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2024

There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groupsMikhail Anokhin. ijac, 34(4):471-490, June 2024. [doi]

2022

Pseudo-free families and cryptographic primitivesMikhail Anokhin. jmc, 16(1):114-140, 2022. [doi]

2020

Pseudo-Free Families and Cryptographic PrimitivesMikhail Anokhin. iacr, 2020:1496, 2020. [doi]

Pseudo-free families of computational universal algebrasMikhail Anokhin. jmc, 15(1):197-222, 2020. [doi]

2019

Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumptionMikhail Anokhin. gcc, 11(2):133-134, 2019. [doi]

2018

Pseudo-Free Families of Computational Universal AlgebrasMikhail Anokhin. iacr, 2018:1178, 2018. [doi]

* is weakly pseudo-free under the general integer factoring intractability assumptionMikhail Anokhin. gcc, 10(2):99-110, 2018. [doi]

2017

Pseudo-free families of finite computationalelementary abelian p-groupsMikhail Anokhin. gcc, 9(1):1, 2017. [doi]

A Certain Family of Subgroups of $\mathbb Z_n^\star$ Is Weakly Pseudo-Free under the General Integer Factoring Intractability AssumptionMikhail Anokhin. iacr, 2017:1131, 2017. [doi]

2015

Pseudo-Free Families of Finite Computational Elementary Abelian p-GroupsMikhail Anokhin. iacr, 2015:1127, 2015. [doi]

2013

Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumptionMikhail Anokhin. gcc, 5(1):53-74, 2013. [doi]

2012

Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability AssumptionMikhail Anokhin. eccc, 19:114, 2012. [doi]

Sign in or sign up to see more results.

runs on WebDSL