68 search results - page 5 / 14 » dcc 2006 |
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...