Sciweavers

177 search results - page 11 / 36
» Overdetermined Elliptic Systems
Sort
View
JOC
2010
106views more  JOC 2010»
13 years 6 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
PSIVT
2007
Springer
203views Multimedia» more  PSIVT 2007»
14 years 1 months ago
Direct Ellipse Fitting and Measuring Based on Shape Boundaries
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
Milos Stojmenovic, Amiya Nayak
ISDA
2006
IEEE
14 years 1 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- 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...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
SAC
2004
ACM
14 years 29 days ago
Concatenate feature extraction for robust 3D elliptic object localization
Developing an efficient object localization system for complicated industrial objects is an important, yet difficult robotic task. To tackle this problem, we have developed a syst...
Yuichi Motai, Akio Kosaka
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
14 years 28 days ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....