Sciweavers

2414 search results - page 8 / 483
» Computing Normal Subgroups
Sort
View
EUROCRYPT
2001
Springer
13 years 12 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
DCC
2008
IEEE
14 years 7 months ago
The trace of an optimal normal element and low complexity normal bases
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
Maria Christopoulou, Theodoulos Garefalakis, Danie...
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 7 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...
ECCC
2000
81views more  ECCC 2000»
13 years 7 months ago
A Linear Space Algorithm for Computing the Hermite Normal Form
Computing the Hermite Normal Form of an n
Daniele Micciancio, Bogdan Warinschi
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
13 years 9 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona