• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 160 matches

• 2019
• 
  Mikhail Anokhin:
  Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumption. Groups Complex. Cryptol. 11(2): 133-134 (2019)
• 
  Rostislav I. Grigorchuk, Dima Grigoriev:
  Key agreement based on automaton groups. Groups Complex. Cryptol. 11(2): 77-81 (2019)
• 
  Delaram Kahrobaei, Keivan Mallahi Karai:
  Some applications of arithmetic groups in cryptography. Groups Complex. Cryptol. 11(1): 25-33 (2019)
• 
  Olga Kharlampovich, Alexei G. Myasnikov, Alexander Taam:
  Effective construction of covers of canonical Hom-diagrams for equations over torsion-free hyperbolic groups. Groups Complex. Cryptol. 11(2): 83-101 (2019)
• 
  Robert P. Kropholler, Davide Spriano:
  Closure properties in the class of multiple context-free groups. Groups Complex. Cryptol. 11(1): 1-15 (2019)
• 
  Chris Monico:
  Cryptanalysis of a hash function, and the modular subset sum problem. Groups Complex. Cryptol. 11(1): 17-23 (2019)
• 
  Dmitry Panteleev, Alexander Ushakov:
  Conjugacy search problem and the Andrews-Curtis conjecture. Groups Complex. Cryptol. 11(1): 43-60 (2019)
• 
  Jyotirmoy Pramanik, Avishek Adhikari:
  Ramp secret sharing with cheater identification in presence of rushing cheaters. Groups Complex. Cryptol. 11(2): 103-113 (2019)
• 
  Vitalii Roman'kov:
  An improved version of the AAG cryptographic protocol. Groups Complex. Cryptol. 11(1): 35-41 (2019)
• 
  Saul Schleimer, Bert Wiest:
  Garside theory and subsurfaces: Some examples in braid groups. Groups Complex. Cryptol. 11(2): 61-75 (2019)
• 
  Mohammad Reza Mirzaee Shamsabad, Seyed Mojtaba Dehnavi, Akbar Mahmoodi Rishakani:
  Randomized nonlinear software-oriented MDS diffusion layers. Groups Complex. Cryptol. 11(2): 123-131 (2019)
• 
  Artem N. Shevlyakov:
  On group automorphisms in universal algebraic geometry. Groups Complex. Cryptol. 11(2): 115-121 (2019)
• 2018
• 
  Mikhail Anokhin:
  A certain family of subgroups of ℤ_n^* is weakly pseudo-free under the general integer factoring intractability assumption. Groups Complex. Cryptol. 10(2): 99-110 (2018)
• 
  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. Groups Complex. Cryptol. 10(2): 111-118 (2018)
• 
  Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Dennis Spellman:
  Orderable groups, elementary theory, and the Kaplansky conjecture. Groups Complex. Cryptol. 10(1): 43-52 (2018)
• 
  Mohammad Hossein Ghaffari, Zohreh Mostaghim:
  More secure version of a Cayley hash function. Groups Complex. Cryptol. 10(1): 29-32 (2018)
• 
  Robert H. Gilman, Robert P. Kropholler, Saul Schleimer:
  Groups whose word problems are not semilinear. Groups Complex. Cryptol. 10(2): 53-62 (2018)
• 
  Alexey Gribov, Delaram Kahrobaei, Vladimir Shpilrain:
  Practical private-key fully homomorphic encryption in rings. Groups Complex. Cryptol. 10(1): 17-27 (2018)
• 
  Meng-Che Ho:
  The word problem of ℤ n is a multiple context-free language. Groups Complex. Cryptol. 10(1): 9-15 (2018)
• 
  Marek Kaluba, Piotr W. Nowak:
  Certifying numerical estimates of spectral gaps. Groups Complex. Cryptol. 10(1): 33-41 (2018)
• 
  Matvei Kotov, Dmitry Panteleev, Alexander Ushakov:
  Analysis of secret sharing schemes based on Nielsen transformations. Groups Complex. Cryptol. 10(1): 1-8 (2018)
• 
  Vitaly Roman'kov:
  Two general schemes of algebraic cryptography. Groups Complex. Cryptol. 10(2): 83-98 (2018)
• 
  Pedro V. Silva, Alexander Zakharov:
  On finitely generated submonoids of virtually free groups. Groups Complex. Cryptol. 10(2): 63-82 (2018)
• 2017
• 
  Mikhail Anokhin:
  Pseudo-free families of finite computationalelementary abelian p-groups. Groups Complex. Cryptol. 9(1): 1 (2017)
• 
  Jack O. Button:
  Free by cyclic groups and linear groups with restricted unipotent elements. Groups Complex. Cryptol. 9(2): 137-149 (2017)
• 
  Jean-Marie Chauvet, Eric Mahe:
  Cryptography from the tropical Hessian pencil. Groups Complex. Cryptol. 9(1): 19 (2017)
• 
  Bettina Eick, Ann-Kristin Engel:
  The isomorphism problem for torsion free nilpotent groups of Hirsch length at most 5. Groups Complex. Cryptol. 9(1): 55 (2017)
• 
  Stefan Friedl:
  An elementary proof of the group law for elliptic curves. Groups Complex. Cryptol. 9(2): 117-123 (2017)
• 
  Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov:
  Random nilpotent groups, polycyclic presentations, and Diophantine problems. Groups Complex. Cryptol. 9(2): 99-115 (2017)
• 
  Frantisek Marko, Alexandr N. Zubkov, Martin Jurás:
  Public-key cryptosystem based on invariants of diagonalizable groups. Groups Complex. Cryptol. 9(1): 31 (2017)

skipping 130 more matches