Sciweavers

EUROCRYPT
2012
Springer
12 years 2 months ago
Fully Homomorphic Encryption with Polylog Overhead
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...
Craig Gentry, Shai Halevi, Nigel P. Smart
JSC
2010
70views more  JSC 2010»
13 years 7 months ago
Liouvillian solutions of linear difference-differential equations
For a field k with an automorphism and a derivation , we introduce the notion of liouvillian solutions of linear difference-differential systems {(Y ) = AY, (Y ) = BY } over k an...
Ruyong Feng, Michael F. Singer, Min Wu
MOC
2000
75views more  MOC 2000»
13 years 12 months ago
Some polynomials over Q(t) and their Galois groups
Abstract. Examples of polynomials with Galois group over Q(t) corresponding to every transitive group through degree eight are calculated, constructively demonstrating the existenc...
Gene Ward Smith
ACS
2008
14 years 8 days ago
Group Corings
We introduce group corings, and study functors between categories of comodules over group corings, and the relationship to graded modules over graded rings. Galois group corings ar...
Stefaan Caenepeel, K. Janssen, S. H. Wang
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
14 years 3 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover