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

DOI10.1515/GCC-2019-2009MaRDI QIDQ2178754zbMATH OpenOpenAlexWikidataFDO

Authors Mikhail Anokhin

Publication date 11 May 2020

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

Full work available at URL https://doi.org/10.1515/gcc-2019-2009

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) Factorization (11Y05) Quasivarieties and varieties of groups (20E10)

Recommendations

• 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
• Erratum: A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
• Erratum to: ``Free abelian lattice-ordered groups
• Erratum: On restricting subsets of bases in relatively free groups.
• Erratum to: Special primitive pairs in finite groups.
• Erratum to ``Order free integers \((\mod m)\)
• scientific article; zbMATH DE number 3906726
• Corrigendum to: ``The critical number of finite abelian groups
• The computational complexity of torsion-freeness of finitely presented groups

Cites work

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

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178754)