88 search results - page 16 / 18 » Subquadratic-time factoring of polynomials over finite field... |
CHES
2000
Springer
13 years 10 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
ENC
2004
IEEE
13 years 9 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....
COMBINATORICS
2006
13 years 5 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
ALGORITHMICA
2006
13 years 5 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
TIT
2008
13 years 5 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...