Combinatorial group theory and public key cryptography
From MaRDI portal
Publication:2432561
DOI10.1007/s00200-006-0006-9zbMath1104.94038arXivmath/0410068OpenAlexW1821434174MaRDI QIDQ2432561
Gabriel Zapata, Vladimir Shpilrain
Publication date: 25 October 2006
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410068
Generators, relations, and presentations of groups (20F05) Cryptography (94A60) Braid groups; Artin groups (20F36) Cancellation theory of groups; application of van Kampen diagrams (20F06)
Related Items (26)
Group ring based public key cryptosystems ⋮ New public key cryptosystems from combinatorial group theory ⋮ Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem ⋮ Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1 ⋮ Public key protocols over the ring \(E_{p}^{(m)}\) ⋮ Discrete logarithms for finite groups ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Monoidal categories, representation gap and cryptography ⋮ Rewriting system of certain semigroups with three generators ⋮ Non-associative public-key cryptography ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups ⋮ Generic complexity of finitely presented monoids and semigroups ⋮ On the conjugacy search problem and left conjugacy closed loops ⋮ The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups ⋮ Linear decomposition method in analyzing hidden information protocols on algebraic platforms ⋮ On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ Conjugacy in Baumslag's group, generic case complexity, and division in power circuits ⋮ Properties of certain semigroups and their potential as platforms for cryptosystems ⋮ Using Decision Problems in Public Key Cryptography ⋮ Small overlap monoids. I: The word problem. ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A novel public-key encryption scheme based on Bass cyclic units in integral group rings
Cites Work
- Average-case complexity and decision problems in group theory.
- Artin groups and infinite Coxeter groups
- Generic-case complexity, decision problems in group theory, and random walks.
- An algebraic method for public-key cryptography
- Artin groups of extra-large type are biautomatic
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial group theory and public key cryptography
