A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption

DOI10.1515/gcc-2018-0007zbMath1489.68100OpenAlexW2897601298WikidataQ114595331 ScholiaQ114595331MaRDI QIDQ2317166

Mikhail Anokhin

Publication date: 8 August 2019

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

Full work available at URL: https://doi.org/10.1515/gcc-2018-0007

zbMATH Keywords

abelian groupfamily of computational groupsgeneral integer factoring intractability assumptionweakly pseudo-free family of computational groups

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Factorization (11Y05) Abelian groups (20K99) Computational methods for problems pertaining to group theory (20-08)

Related Items (2)

Pseudo-free families and cryptographic primitives ⋮ Pseudo-free families of computational universal algebras

Cites Work

• Unnamed Item
• Pseudo-free families of finite computational elementary abelian \(p\)-groups
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
• The RSA group is pseudo-free
• Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
• Adaptive Pseudo-free Groups and Applications
• Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree
• Detecting perfect powers in essentially linear time
• Computational Complexity
• Theory of Cryptography

This page was built for publication: A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption