43 search results - page 3 / 9 » A Fast Finite Field Multiplier |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—In this study, a robust minimum variance beamformer (RMVB) is employed for source reconstruction in simultaneous MEG and local field potential (LFP) measurements. RMVB ...
ASAP
2004
IEEE
13 years 9 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
ISSAC
2009
Springer
13 years 12 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
CHES
2004
Springer
13 years 10 months ago
2004
Springer
ASIACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...