Sciweavers

88 search results - page 15 / 18
» Computing automorphisms of semigroups
Sort
View
MFCS
2001
Springer
13 years 11 months ago
The Size of Power Automata
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...
Klaus Sutner
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
13 years 9 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
Vladimir Shpilrain, Alexander Ushakov
IJAC
2002
128views more  IJAC 2002»
13 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
13 years 7 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata
MOC
2011
13 years 2 months ago
Computing systems of Hecke eigenvalues associated to Hilbert modular forms
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...
Matthew Greenberg, John Voight