4212 search results - page 18 / 843 » On Compressible Pairings and Their Computation |
104
Voted
CISST
2003
15 years 1 months ago
2003
We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivit...
ACL
2009
14 years 10 months ago
2009
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of Ngram language models based on LOUDS, a succinct data stru...
PAIRING
2009
Springer
15 years 7 months ago
2009
Springer
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
84
Voted
PAIRING
2007
Springer
15 years 6 months ago
2007
Springer
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...
90
Voted
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...