scientific article; zbMATH DE number 2144687

MaRDI QIDQ4656963zbMATH OpenFDO

Authors Vladimir Shpilrain

Publication date 14 March 2005

Full work available at URL https://arxiv.org/abs/math/0311047

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Probabilistic methods in group theory (20P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• Combinatorial group theory and public key cryptography
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• Braid Group Cryptography
• Towards generating secure keys for braid cryptography

Cited in

(14)

• Complexity of the generalized conjugacy problem
• Probability on groups and an application to cryptography
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• Combinatorial group theory and public key cryptography
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
• scientific article; zbMATH DE number 5380260 (Why is no real title available?)
• scientific article; zbMATH DE number 5177768 (Why is no real title available?)
• Public key cryptography based on Moufang loops
• scientific article; zbMATH DE number 6403891 (Why is no real title available?)
• Search problems in groups and branching processes.
• PERFORMANCE EVALUATION OF SECURE GROUP COMMUNICATION
• On the rational subset problem for groups.
• On the conjugacy search problem and left conjugacy closed loops

This page was built for publication:

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