Sciweavers

97 search results - page 17 / 20
» Finding roots of polynomials over finite fields
Sort
View
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 8 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
CVPR
2007
IEEE
14 years 9 months ago
An Efficient Minimal Solution for Infinitesimal Camera Motion
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...
Chris Engels, David Nistér, Henrik Stew&eac...
ISLPED
1997
ACM
110views Hardware» more  ISLPED 1997»
13 years 11 months ago
A one division per clock pipelined division architecture based on LAPR (lookahead of partial-remainder) for low-power ECC applic
We propose a pipelined division architecture for low-power ECC applications, which is based on partialdivision on group basis and lookahead technique exploiting the linearity in f...
Hyung-Joon Kwon, Kwyro Lee
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
13 years 11 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
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...
Gerardo Orlando, Christof Paar
ENC
2004
IEEE
13 years 11 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe