6 search results - page 1 / 2 » aaecc 2008 |
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
AAECC
2008
Springer
13 years 9 months ago
2008
Springer
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what propert...
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...