97 search results - page 18 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
CIS
2006
Springer
13 years 10 months ago
2006
Springer
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
TCSV
2008
13 years 6 months ago
2008
Dual-camera systems have been widely used in surveillance because of the ability to explore the wide field of view (FOV) of the omnidirectional camera and the wide zoom range of th...
TIT
2008
13 years 6 months ago
2008
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
ICDE
2009
IEEE
13 years 4 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...