Algorithmic problems in Engel groups and cryptographic applications
From MaRDI portal
Publication:5124360
DOI10.22108/IJGT.2020.119123.1574zbMATH Open1443.20063arXiv2001.11577OpenAlexW3009881977MaRDI QIDQ5124360FDOQ5124360
Delaram Kahrobaei, Marialaura Noce
Publication date: 18 September 2020
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.
Full work available at URL: https://arxiv.org/abs/2001.11577
Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Engel conditions (20F45)
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Isoclinism classes and commutativity degrees of finite groups
- Lie methods in growth of groups and groups of finite width
- How to share a secret
- Word Problems Solvable in Logspace
- n-Isoclinism Classes and n-Nilpotency Degree of Finite Groups
- On the Relative Commutativity Degree of a Subgroup of a Finite Group
- An algorithmic problem for nilpotent groups and rings
- Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
- Title not available (Why is that?)
- INFINITE PERIODIC GROUPS. I
- What is the Probability that Two Group Elements Commute?
- Conjugacy in polycyclic groups
- Conjugate separability in polycyclic groups
- A secret sharing scheme based on group presentations and the word problem
- Public Key Exchange Using Semidirect Product of (Semi)Groups
- Search and witness problems in group theory
- Title not available (Why is that?)
- Using Semidirect Product of (Semi)groups in Public Key Cryptography
- The status of polycyclic group-based cryptography: a survey and open problems
- Decidable Properties of Polycyclic Groups
- Title not available (Why is that?)
- 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
- Engelsche Elemente Noetherscher Gruppen
- Two-Generator conditions for Residually Finite Groups
- Cryptosystems using linear groups
- Engelsche Elemente der Länge drei. (Engel elements of length three.)
- Title not available (Why is that?)
- Structure computation and discrete logarithms in finite abelian $p$-groups
- The solubility of certain decision problems in arithmetic and algebra
- A Remark on the Structure ofN-Engel Groups
- Conjugacy in polycyclic groups
- Eine Bemerkung über engelsche Elemente
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete logarithms: The past and the future
- Conjugacy in Nilpotent Groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multilinear cryptography using nilpotent groups
- Algorithmic problems in right-angled Artin groups: complexity and applications
- The hidden subgroup problem and post-quantum group-based cryptography
- Algorithmic Decidability of Engel’s Property for Automaton Groups
- Degree of commutativity of infinite groups
- Bilinear cryptography using groups of nilpotency class 2
- Title not available (Why is that?)
- Engel elements in weakly branch groups
- Engel elements in some fractal groups
- A note on Engel elements in the first Grigorchuk group
- Generalized Learning Problems and Applications to Non-commutative Cryptography
- Hardness of learning problems over Burnside groups of exponent 3
- Title not available (Why is that?)
Cited In (2)
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)
