205 search results - page 19 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
ALGORITHMICA
2002
13 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
ENC
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
PKC
2000
Springer
13 years 11 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
WSC
2000
13 years 8 months ago
2000
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...