Sciweavers

PAIRING
2007
Springer
132views Cryptology» more  PAIRING 2007»
14 years 5 months ago
Instruction Set Extensions for Pairing-Based Cryptography
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means m...
Tobias Vejda, Dan Page, Johann Großschä...
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
14 years 5 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
PAIRING
2007
Springer
14 years 5 months ago
On Pairing Inversion Problems
Takakazu Satoh
PAIRING
2007
Springer
134views Cryptology» more  PAIRING 2007»
14 years 5 months ago
Proxy Re-encryption Systems for Identity-Based Encryption
A proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice’s public key into the different ciphertexts that can be decrypted by Bob’s secret ...
Toshihiko Matsuo
PAIRING
2007
Springer
119views Cryptology» more  PAIRING 2007»
14 years 5 months ago
Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
Benoît Libert, Jean-Jacques Quisquater
PAIRING
2007
Springer
14 years 5 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo
PAIRING
2007
Springer
14 years 5 months ago
On the Minimal Embedding Field
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
Laura Hitt
PAIRING
2007
Springer
14 years 5 months ago
Hyperelliptic Pairings
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptograph...
Steven D. Galbraith, Florian Hess, Frederik Vercau...
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
14 years 5 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