1400 search results - page 2 / 280 » On multiplication in finite fields |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
SIAMCOMP
2008
13 years 7 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
ISSAC
2004
Springer
14 years 24 days ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
ASIACRYPT
1999
Springer
13 years 11 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...
ISDA
2006
IEEE
14 years 1 months ago
2006
IEEE
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...