53 search results - page 2 / 11 » Constructive homomorphisms for classical groups |
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
EUROCRYPT
2012
Springer
11 years 8 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
ISW
2007
Springer
14 years 9 days ago
2007
Springer
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security ...
ANTS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...