A proposed public key cryptosystem using the modular group
From MaRDI portal
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Probabilistic methods in group theory (20P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Grammars and rewriting systems (68Q42) Cryptography (94A60)
Recommendations
Cited in
(10)- Cryptanalysis of a combinatorial public key cryptosystem
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- Cryptosystems using linear groups
- scientific article; zbMATH DE number 1618049 (Why is no real title available?)
- On public-key cryptosystems based on combinatorial group theory
- scientific article; zbMATH DE number 1186880 (Why is no real title available?)
- scientific article; zbMATH DE number 1303981 (Why is no real title available?)
- Properties of certain semigroups and their potential as platforms for cryptosystems
- On public-key cryptosystem based on Church-Rosser string-rewriting systems
- Rewriting system of certain semigroups with three generators
This page was built for publication: A proposed public key cryptosystem using the modular group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442567)