205 search results - page 26 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
LATIN
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— The capacity of multiple input multiple output (MIMO) system over wireless channels has been investigated analytically and by simulation over different types of wireless fading...
DSD
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we present an analysis of the minimal hardware precision required to implement Support Vector Machine (SVM) classification within a Logarithmic Number System archite...
CHES
2008
Springer
13 years 9 months ago
2008
Springer
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...