Abstract
In several recent works of D. Kahrobaei, C. Koupparis, and V. Shpilrain,
public-key protocols have been proposed which depend on the difficulty
of computing discrete logarithms in matrix rings over group rings. In particular,
the specific ring of 3Ć—3 matrices over
We are grateful to the anonymous referee and editors for valuable feedback and suggestions on earlier drafts of this paper.
Ā© 2015 by De Gruyter
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels