Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption

DOI10.1515/gcc-2013-0003zbMath1286.68174OpenAlexW2024685286MaRDI QIDQ2873318

Mikhail Anokhin

Publication date: 23 January 2014

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2013-0003

zbMATH Keywords

variety of groupscomputational groupgeneral integer-factoring intractability assumptionpseudo-free family of finite computational groups

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quasivarieties and varieties of groups (20E10) Factorization (11Y05)

Related Items (5)

Pseudo-free families and cryptographic primitives ⋮ Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption ⋮ Pseudo-free families of finite computational elementary abelian \(p\)-groups ⋮ Pseudo-free families of computational universal algebras ⋮ A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption

This page was built for publication: Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption