Sciweavers

173 search results - page 21 / 35
» Overview of Elliptic Curve Cryptography
Sort
View
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
14 years 4 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman
WAIFI
2010
Springer
160views Mathematics» more  WAIFI 2010»
14 years 1 months ago
Speeding Up Bipartite Modular Multiplication
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
ANTS
2006
Springer
125views Algorithms» more  ANTS 2006»
14 years 1 months ago
Arithmetic of Generalized Jacobians
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that ...
Isabelle Déchène
FPL
2010
Springer
168views Hardware» more  FPL 2010»
13 years 7 months ago
Pipelined FPGA Adders
Integer addition is a universal building block, and applications such as quad-precision floating-point or elliptic curve cryptography now demand precisions well beyond 64 bits. Thi...
Florent de Dinechin, Hong Diep Nguyen, Bogdan Pasc...
ISW
2010
Springer
13 years 7 months ago
Privacy-Preserving ECC-Based Grouping Proofs for RFID
The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags...
Lejla Batina, Yong Ki Lee, Stefaan Seys, Dave Sing...