92 search results - page 4 / 19 » Compressed Pairings |
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
3DIM
2003
IEEE
13 years 11 months ago
2003
IEEE
A statistical representation of three-dimensional shapes is introduced, based on a novel four-dimensional feature. The feature parameterizes the intrinsic geometrical relation of ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
ACISP
2004
Springer
13 years 11 months ago
2004
Springer
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...