Groups Complexity Cryptology - researchr journal

117	--	139	Neal Koblitz, Alfred Menezes. Another look at non-uniformity
141	--	167	Daan Krammer. An asymmetric generalisation of Artin monoids
169	--	191	Arkadius G. Kalka, Mina Teicher. Non-associative key establishment for left distributive systems
193	--	209	Maggie Habeeb, Delaram Kahrobaei. On the dimension of matrix representations of finitely generated torsion free nilpotent groups
211	--	221	Amnon Rosenmann. On the intersection of subgroups in free groups: Echelon subgroups are inert
223	--	238	Benjamin Fine, Anja I. S. Moldenhauer, Gerhard Rosenberger. A secret sharing scheme based on the Closest Vector Theorem and a modification to a private key cryptosystem

1	--	23	Derek F. Holt, Sarah Rees. Shortlex automaticity and geodesic regularity in Artin groups
25	--	30	Alexander Rybalov. Generic complexity of the Diophantine problem
31	--	52	Dima Grigoriev, Vladimir Shpilrain. Secrecy without one-way functions
53	--	74	Mikhail Anokhin. Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
75	--	89	Thomas Connor, Dimitri Leemans. A new algorithm to find apartments in coset geometries
91	--	96	Benjamin Fine, Gerhard Rosenberger. Faithful representations of limit groups II
97	--	115	Delaram Kahrobaei, Charalambos Koupparis, Vladimir Shpilrain. Public key exchange using matrices over group rings

External Links