Algorithmic problems in Engel groups and cryptographic applications
From MaRDI portal
Publication:5124360
Abstract: The theory of Engel groups plays an important role in group theory since these groups are closely related to the Burnside problems. In this survey we consider several classical and novel algorithmic problems for Engel groups and propose several open problems. We study these problems with a view towards applications to cryptography.
Recommendations
- Algorithmic decidability of Engel's property for automaton groups
- scientific article; zbMATH DE number 1370595
- scientific article; zbMATH DE number 5982274
- Algorithmic problems in right-angled Artin groups: complexity and applications
- The complexity of Grigorchuk groups with application to cryptography
Cites work
- scientific article; zbMATH DE number 5982274 (Why is no real title available?)
- scientific article; zbMATH DE number 3173727 (Why is no real title available?)
- scientific article; zbMATH DE number 1283945 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- scientific article; zbMATH DE number 2144695 (Why is no real title available?)
- scientific article; zbMATH DE number 1370595 (Why is no real title available?)
- scientific article; zbMATH DE number 3360375 (Why is no real title available?)
- scientific article; zbMATH DE number 3078523 (Why is no real title available?)
- scientific article; zbMATH DE number 3099381 (Why is no real title available?)
- 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
- A note on Engel elements in the first Grigorchuk group
- A remark on the structure of \(n\)-Engel groups
- A secret sharing scheme based on group presentations and the word problem
- Algorithmic decidability of Engel's property for automaton groups
- Algorithmic problems in right-angled Artin groups: complexity and applications
- An algorithmic problem for nilpotent groups and rings
- Bilinear cryptography using groups of nilpotency class 2
- Conjugacy in Nilpotent Groups
- Conjugacy in polycyclic groups
- Conjugacy in polycyclic groups
- Conjugate separability in polycyclic groups
- Cryptosystems using linear groups
- Decidable Properties of Polycyclic Groups
- Degree of commutativity of infinite groups
- Discrete logarithms: The past and the future
- Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
- Eine Bemerkung über engelsche Elemente
- Engel elements in some fractal groups
- Engel elements in weakly branch groups
- Engelsche Elemente Noetherscher Gruppen
- Engelsche Elemente der Länge drei. (Engel elements of length three.)
- Finding \(n\)-th roots in nilpotent groups and applications in cryptology
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Hardness of learning problems over Burnside groups of exponent 3
- How to share a secret
- INFINITE PERIODIC GROUPS. I
- Isoclinism classes and commutativity degrees of finite groups
- Lie methods in growth of groups and groups of finite width
- Multilinear cryptography using nilpotent groups
- On lattices, learning with errors, random linear codes, and cryptography
- On the Relative Commutativity Degree of a Subgroup of a Finite Group
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public key exchange using semidirect product of (semi)groups
- Search and witness problems in group theory.
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- The hidden subgroup problem and post-quantum group-based cryptography
- The solubility of certain decision problems in arithmetic and algebra
- The status of polycyclic group-based cryptography: a survey and open problems
- Two-Generator conditions for Residually Finite Groups
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
- What is the Probability that Two Group Elements Commute?
- Word Problems Solvable in Logspace
- n-Isoclinism Classes and n-Nilpotency Degree of Finite Groups
Cited in
(4)
This page was built for publication: Algorithmic problems in Engel groups and cryptographic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124360)
