4212 search results - page 40 / 843 » On Compressible Pairings and Their Computation |
112
click to vote
CHES
2005
Springer
15 years 6 months ago
2005
Springer
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
104
Voted
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
CIE
2005
Springer
15 years 6 months ago
2005
Springer
Two properties of the Co-Spectrum of the Joint Spectrum tely many abstract structures are presented - a Minimal Pair type theorem and the existence of a Quasi-Minimal degree with r...
105
Voted
TIT
2010
14 years 7 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
104
click to vote
CHES
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...