Sciweavers

63 search results - page 10 / 13
» Efficient Computation of Roots in Finite Fields
Sort
View
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
13 years 11 months ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
ICIP
2009
IEEE
13 years 5 months ago
Lamp: Linear approach for matching points
The 3D object recognition from a single or multiple 2D images is a very important problem in the computer vision field with a wide range of real applications. Considering the affi...
Manuel Marques, João Costeira
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
14 years 8 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
SKG
2006
IEEE
14 years 1 months ago
Hierarchical Multicast Tree Algorithms of Data Grid
Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multicast algorithms...
Weijia Jia, Qingfeng Fan, Qiongli Wu, Yanxiang He
CVPR
2006
IEEE
13 years 11 months ago
Accurate Tracking of Monotonically Advancing Fronts
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...
M. Sabry Hassouna, Aly A. Farag