Pseudo-free families of finite computational elementary abelian \(p\)-groups

DOI10.1515/gcc-2017-0001zbMath1392.20045OpenAlexW3046475356MaRDI QIDQ524639

Mikhail Anokhin

Publication date: 3 May 2017

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

Full work available at URL: https://doi.org/10.1515/gcc-2017-0001

zbMATH Keywords

elementary abelian \(p\)-groupcollision-intractable family of functionsfamily of computational groupsone-way family of functionspseudo-free family of computational groupsweaklypseudo-free family of computational groups

Mathematics Subject Classification ID

Cryptography (94A60) Finite abelian groups (20K01) Finite nilpotent groups, (p)-groups (20D15)

Related Items (3)

Pseudo-free families and cryptographic primitives ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• The RSA group is pseudo-free
• Efficient cryptographic schemes provably as secure as subset sum
• Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
• Public-Key Encryption Schemes with Auxiliary Inputs
• Foundations of Cryptography
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Theory of Cryptography

This page was built for publication: Pseudo-free families of finite computational elementary abelian \(p\)-groups