Sciweavers

177 search results - page 14 / 36
» Overdetermined Elliptic Systems
Sort
View
EUROCRYPT
2001
Springer
14 years 1 days ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
TC
2008
13 years 7 months ago
High-Performance Architecture of Elliptic Curve Scalar Multiplication
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
B. Ansari, M. A. Hasan
CHES
2006
Springer
158views Cryptology» more  CHES 2006»
13 years 11 months ago
Hardware/Software Co-design of Elliptic Curve Cryptography on an 8051 Microcontroller
8-bit microcontrollers like the 8051 still hold a considerable share of the embedded systems market and dominate in the smart card industry. The performance of 8-bit microcontrolle...
Manuel Koschuch, Joachim Lechner, Andreas Weitzer,...
SIAMSC
2008
206views more  SIAMSC 2008»
13 years 7 months ago
The Compact Discontinuous Galerkin (CDG) Method for Elliptic Problems
We present a compact discontinuous Galerkin (CDG) method for an elliptic model problem. The problem is first cast as a system of first order equations by introducing the gradient o...
Jaime Peraire, Per-Olof Persson
INDOCRYPT
2007
Springer
14 years 1 months ago
Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
This paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: – many choices of coordin...
Daniel J. Bernstein, Peter Birkner, Tanja Lange, C...