default search action
Groups Complexity Cryptology, Volume 7
Volume 7, Number 1, May 2015
- Andreas Distler, Bettina Eick:
Group extensions with special properties. 1-10 - Benjamin Atchison, Edward C. Turner:
Symmetries of finite graphs and homology. 11-30 - Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann, Sandeep Murthy:
A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication. 31-46 - Manik Lal Das:
Key-escrow free multi-signature scheme using bilinear pairings. 47-57 - Anthony M. Gaglione, Seymour Lipschutz, Dennis Spellman:
An application of elementary real analysis to a metabelian group admitting integral polynomial exponents. 59-68 - Jordan Sahattchieve:
On convex hulls and the quasiconvex subgroups of Fm×ℤn. 69-80 - Alexei G. Myasnikov, Vitalii Roman'kov:
A linear decomposition attack. 81-94
Volume 7, Number 2, November 2015
- Lluís Bacardit:
A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component. 95-115 - Evgeni Begelfor, Stephen D. Miller, Ramarathnam Venkatesan:
Non-abelian analogs of lattice rounding. 117-133 - Jennifer Taback, Sharif Younes:
Tree-based language complexity of Thompson's group F. 135-152 - Vitalii Roman'kov:
New probabilistic public-key encryption based on the RSA cryptosystem. 153-156 - Stepan Yu. Orevkov:
Algorithmic recognition of quasipositive 4-braids of algebraic length three. 157-173 - Chris Monico, Mara D. Neusel:
Cryptanalysis of a system using matrices over group rings. 175-182 - Artyom S. Ivachev:
On transitive differentiable modulo pn functions. 183-190 - Alexander N. Rybalov:
On the generic complexity of the searching graph isomorphism problem. 191-193 - Jean-Marie Chauvet, Eric Mahe:
Key agreement under tropical parallels. 195-198
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.