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

DOI10.1515/GCC-2019-2009zbMath1441.68062OpenAlexW2396019204WikidataQ127022972 ScholiaQ127022972MaRDI QIDQ2178754

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

Cites Work

• 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