default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGroups Complexity Cryptology, Volume 11
Volume 11, Number 1, May 2019
- Robert P. Kropholler, Davide Spriano
:
Closure properties in the class of multiple context-free groups. 1-15 - Chris Monico:
Cryptanalysis of a hash function, and the modular subset sum problem. 17-23 - Delaram Kahrobaei, Keivan Mallahi Karai:
Some applications of arithmetic groups in cryptography. 25-33 - Vitalii Roman'kov:
An improved version of the AAG cryptographic protocol. 35-41 - Dmitry Panteleev, Alexander Ushakov:
Conjugacy search problem and the Andrews-Curtis conjecture. 43-60
Volume 11, Number 2, November 2019
- Saul Schleimer, Bert Wiest:
Garside theory and subsurfaces: Some examples in braid groups. 61-75 - Rostislav I. Grigorchuk, Dima Grigoriev:
Key agreement based on automaton groups. 77-81 - Olga Kharlampovich, Alexei G. Myasnikov, Alexander Taam:
Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups. 83-101 - Jyotirmoy Pramanik, Avishek Adhikari:
Ramp secret sharing with cheater identification in presence of rushing cheaters. 103-113 - Artem N. Shevlyakov:
On group automorphisms in universal algebraic geometry. 115-121 - Mohammad Reza Mirzaee Shamsabad, Seyed Mojtaba Dehnavi, Akbar Mahmoodi Rishakani:
Randomized nonlinear software-oriented MDS diffusion layers. 123-131 - Mikhail Anokhin:
Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumption. 133-134
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-01-24 17:11 CET 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:
