Algorithmic problems in Engel groups and cryptographic applications

DOI10.22108/ijgt.2020.119123.1574zbMath1443.20063arXiv2001.11577OpenAlexW3009881977MaRDI QIDQ5124360

Delaram Kahrobaei, Marialaura Noce

Publication date: 18 September 2020

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

zbMATH Keywords

cryptographyEngel elementsalgorithmic problems

Mathematics Subject Classification ID

Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Engel conditions (20F45)

Related Items (2)

Cryptographic multilinear maps using pro-\(p\) groups ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The status of polycyclic group-based cryptography: a survey and open problems
• Engelsche Elemente Noetherscher Gruppen
• Eine Bemerkung über engelsche Elemente
• An algorithmic problem for nilpotent groups and rings
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Conjugacy in polycyclic groups
• Conjugate separability in polycyclic groups
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Algorithmic problems in right-angled Artin groups: complexity and applications
• The hidden subgroup problem and post-quantum group-based cryptography
• Bilinear cryptography using groups of nilpotency class 2
• Isoclinism classes and commutativity degrees of finite groups
• Discrete logarithms: The past and the future
• Engel elements in weakly branch groups
• Engel elements in some fractal groups
• Hardness of learning problems over Burnside groups of exponent 3
• Cryptosystems using linear groups
• Engelsche Elemente der Länge drei. (Engel elements of length three.)
• A Secret Sharing Scheme Based on Group Presentations and the Word Problem
• Public Key Exchange Using Semidirect Product of (Semi)Groups
• A Remark on the Structure ofN-Engel Groups
• How to share a secret
• Structure computation and discrete logarithms in finite abelian $p$-groups
• Search and witness problems in group theory
• Generalized Learning Problems and Applications to Non-commutative Cryptography
• Using Semidirect Product of (Semi)groups in Public Key Cryptography
• Decidable Properties of Polycyclic Groups
• The solubility of certain decision problems in arithmetic and algebra
• Two-Generator conditions for Residually Finite Groups
• Word Problems Solvable in Logspace
• Conjugacy in polycyclic groups
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• What is the Probability that Two Group Elements Commute?
• n-Isoclinism Classes and n-Nilpotency Degree of Finite Groups
• Multilinear cryptography using nilpotent groups
• A note on Engel elements in the first Grigorchuk group
• Degree of commutativity of infinite groups
• Conjugacy in Nilpotent Groups
• On the Relative Commutativity Degree of a Subgroup of a Finite Group
• INFINITE PERIODIC GROUPS. I
• 4-ENGEL GROUPS ARE LOCALLY NILPOTENT
• Algorithmic Decidability of Engel’s Property for Automaton Groups
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Algorithmic problems in Engel groups and cryptographic applications