43 search results - page 7 / 9 » A Fast Finite Field Multiplier |
CSREAESA
2008
13 years 11 months ago
2008
A group testing-based BIST technique to identify faulty hard cores in FPGA devices is presented. The method provides for isolation of faults in embedded cores as demonstrated by ex...
CARDIS
2008
Springer
13 years 11 months ago
2008
Springer
Digital signatures are one of the most important applications of microprocessor smart cards. The most widely used algorithms for digital signatures, RSA and ECDSA, depend on finite...
PKC
2000
Springer
14 years 1 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...
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
TSP
2010
13 years 4 months ago
2010
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...