default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGroups Complexity Cryptology, Volume 5
Volume 5, Number 1, May 2013
- Derek F. Holt, Sarah Rees:
Shortlex automaticity and geodesic regularity in Artin groups. 1-23 - Alexander N. Rybalov
:
Generic complexity of the Diophantine problem. 25-30 - Dima Grigoriev, Vladimir Shpilrain:
Secrecy without one-way functions. 31-52 - Mikhail Anokhin:
Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption. 53-74 - Thomas Connor, Dimitri Leemans:
A new algorithm to find apartments in coset geometries. 75-89 - Benjamin Fine, Gerhard Rosenberger:
Faithful representations of limit groups II. 91-96 - Delaram Kahrobaei, Charalambos Koupparis, Vladimir Shpilrain:
Public key exchange using matrices over group rings. 97-115
Volume 5, Number 2, November 2013
- Neal Koblitz, Alfred Menezes:
Another look at non-uniformity. 117-139 - Daan Krammer:
An asymmetric generalisation of Artin monoids. 141-167 - Arkadius G. Kalka, Mina Teicher:
Non-associative key establishment for left distributive systems. 169-191 - Maggie E. Habeeb, Delaram Kahrobaei:
On the dimension of matrix representations of finitely generated torsion free nilpotent groups. 193-209 - Amnon Rosenmann:
On the intersection of subgroups in free groups: Echelon subgroups are inert. 211-221 - 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. 223-238
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.
last updated on 2025-06-26 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
