Journal: Groups Complexity Cryptology

Volume 10, Issue 2

53 -- 62Robert H. Gilman, Robert P. Kropholler, Saul Schleimer. Groups whose word problems are not semilinear
63 -- 82Pedro V. Silva, Alexander Zakharov. On finitely generated submonoids of virtually free groups
83 -- 98Vitaly Roman'kov. Two general schemes of algebraic cryptography
99 -- 110Mikhail Anokhin. * is weakly pseudo-free under the general integer factoring intractability assumption
111 -- 118Alireza Khalili Asboei. Recognition of 2-dimensional projective linear groups by the group order and the set of numbers of its elements of each order

Volume 10, Issue 1

1 -- 8Matvei Kotov, Dmitry Panteleev, Alexander Ushakov. Analysis of secret sharing schemes based on Nielsen transformations
9 -- 15Meng-Che Ho. The word problem of ℤ n is a multiple context-free language
17 -- 27Alexey Gribov, Delaram Kahrobaei, Vladimir Shpilrain. Practical private-key fully homomorphic encryption in rings
29 -- 32Mohammad Hossein Ghaffari, Zohreh Mostaghim. More secure version of a Cayley hash function
33 -- 41Marek Kaluba, Piotr W. Nowak. Certifying numerical estimates of spectral gaps
43 -- 52Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Dennis Spellman. Orderable groups, elementary theory, and the Kaplansky conjecture