


default search action
Groups Complexity Cryptology, Volume 10
Volume 10, Number 1, May 2018
- Matvei Kotov

, Dmitry Panteleev, Alexander Ushakov
:
Analysis of secret sharing schemes based on Nielsen transformations. 1-8 - Meng-Che Ho

:
The word problem of ℤ n is a multiple context-free language. 9-15 - Alexey Gribov, Delaram Kahrobaei

, Vladimir Shpilrain:
Practical private-key fully homomorphic encryption in rings. 17-27 - Mohammad Hossein Ghaffari

, Zohreh Mostaghim
:
More secure version of a Cayley hash function. 29-32 - Marek Kaluba

, Piotr W. Nowak
:
Certifying numerical estimates of spectral gaps. 33-41 - Benjamin Fine, Anthony M. Gaglione

, Gerhard Rosenberger, Dennis Spellman:
Orderable groups, elementary theory, and the Kaplansky conjecture. 43-52
Volume 10, Number 2, November 2018
- Robert H. Gilman, Robert P. Kropholler, Saul Schleimer:

Groups whose word problems are not semilinear. 53-62 - Pedro V. Silva

, Alexander Zakharov
:
On finitely generated submonoids of virtually free groups. 63-82 - Vitaly Roman'kov

:
Two general schemes of algebraic cryptography. 83-98 - Mikhail Anokhin

:
A certain family of subgroups of ℤn* is weakly pseudo-free under the general integer factoring intractability assumption. 99-110 - Alireza Khalili Asboei

:
Recognition of 2-dimensional projective linear groups by the group order and the set of numbers of its elements of each order. 111-118

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














