Pages that link to "Item:Q1403868"
From MaRDI portal
The following pages link to Conjugacy problem for braid groups and Garside groups. (Q1403868):
Displayed 18 items.
- Garside groups are strongly translation discrete. (Q875106) (← links)
- A Garside-theoretic approach to the reducibility problem in braid groups. (Q947495) (← links)
- Towards generating secure keys for braid cryptography (Q1008952) (← links)
- Left-Garside categories, self-distributivity, and braids (Q1034190) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- The \(n\)th root of a braid is unique up to conjugacy. (Q1880607) (← links)
- Tame Garside monoids. (Q1887470) (← links)
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view (Q2432564) (← links)
- Conjugacy in Garside groups. II: Structure of the ultra summit set. (Q2475043) (← links)
- Entity authentication schemes using braid word reduction (Q2489938) (← links)
- A weak key test for braid based cryptography. (Q2491313) (← links)
- A new approach to the conjugacy problem in Garside groups. (Q2576204) (← links)
- Conjugacy Problem for Subgroups with Applications to Artin Groups and Braid Type Group (Q3422846) (← links)
- Abelian Subgroups of Garside Groups (Q3510076) (← links)
- On the structure of the centralizer of a braid (Q4651829) (← links)
- There exist conjugate simple braids whose associated permutations are not strongly conjugate (Q5434690) (← links)
- Transitive Signatures from Braid Groups (Q5458209) (← links)
- A New Approach to Extracting Roots in Garside Groups (Q5478689) (← links)