A certain family of subgroups of Z_n^ is weakly pseudo-free under the general integer factoring intractability assumption

DOI10.1515/GCC-2018-0007zbMATH Open1489.68100OpenAlexW2897601298WikidataQ114595331 ScholiaQ114595331MaRDI QIDQ2317166FDOQ2317166

Authors: 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

Recommendations

• Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
• Theory of Cryptography
• The RSA Group is Pseudo-Free
• The RSA group is pseudo-free
• Sampling from signed quadratic residues: RSA group is pseudofree

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)

Cites Work

• Title not available (Why is that?)
• Computational Complexity
• Adaptive pseudo-free groups and applications
• The RSA group is pseudo-free
• 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
• Theory of Cryptography
• Detecting perfect powers in essentially linear time
• Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
• Sampling from signed quadratic residues: RSA group is pseudofree

Cited In (3)

• Pseudo-free families and cryptographic primitives
• Pseudo-free families of computational universal algebras
• Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption

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

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