Using the subgroup membership search problem in public key cryptography

MaRDI QIDQ3545329zbMATH OpenFDO

Authors Vladimir Shpilrain, Gabriel Zapata

Publication date 10 December 2008

zbMATH Keywords

decomposition problemconjugacy search problempublic key exchange

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Generators, relations, and presentations of groups (20F05)

Recommendations

• scientific article; zbMATH DE number 2080707
• Using Decision Problems in Public Key Cryptography
• Combinatorial group theory and public key cryptography
• Thompson’s Group and Public Key Cryptography
• A public key cryptosystem based on a subgroup membership problem

Cited in

(11)

• Two general schemes of algebraic cryptography
• Diophantine cryptography over infinite groups
• scientific article; zbMATH DE number 2080707 (Why is no real title available?)
• Subsets of groups in public-key cryptography
• On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
• A nonlinear decomposition attack
• The status of polycyclic group-based cryptography: a survey and open problems
• The subpower membership problem of 2-nilpotent algebras
• Properties of certain semigroups and their potential as platforms for cryptosystems
• The subpower membership problem for finite algebras with cube terms
• Thompson’s Group and Public Key Cryptography

Describes a project that uses

Uses Software

• CBraid

This page was built for publication: Using the subgroup membership search problem in public key cryptography

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