4212 search results - page 536 / 843 » On Compressible Pairings and Their Computation |
170
click to vote
ANTS
1998
Springer
15 years 11 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
192
click to vote
ACISP
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can pro...
167
click to vote
ESWS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
159
click to vote
FINTAL
2006
15 years 10 months ago
2006
This paper investigates the combination of word-alignments computed with the competitive linking algorithm and well-established IBM models. New training methods for phrase-based st...
177
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We present a chosen-ciphertext attack against both NICE cryptosystems. These two cryptosystems are based on computations in the class group of non-maximal imaginary orders. More pr...