scientific article; zbMATH DE number 2144687
From MaRDI portal
Publication:4656963
zbMath1161.68486arXivmath/0311047MaRDI QIDQ4656963
Publication date: 14 March 2005
Full work available at URL: https://arxiv.org/abs/math/0311047
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probabilistic methods in group theory (20P05)
Related Items (6)
Public key cryptography based on Moufang loops ⋮ On the rational subset problem for groups. ⋮ Combinatorial group theory and public key cryptography ⋮ The conjugacy search problem in public key cryptography: unnecessary and insufficient ⋮ On the conjugacy search problem and left conjugacy closed loops ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
This page was built for publication:
