126 search results - page 17 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
ISSS
2002
IEEE
14 years 1 months ago
2002
IEEE
With the popularity of wireless communication devices a new important dimension of embedded systems design has arisen, that of security. This paper presents for the first time des...
CHES
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
ESAS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
EUROCRYPT
1999
Springer
14 years 21 days ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...