Oct 25, 2012 · We show factor-4 and 6 compression and decompression for the values of the pairings with the supersingular elliptic curves of embedding degrees ...
The security of pairing-based cryptosystems relies on the hardness of the discrete logarithm problems in elliptic curves and in finite fields related to the ...
Factor-4 and 6 (De)Compression for Values of Pairings Using Trace ...
www.semanticscholar.org › paper
A decompressible trace representation with additional information is proposed that is as efficient as the affine representation in terms of the costs of ...
We show factor-4 and 6 compression and decompression for the values of the pairings with the supersingular elliptic curves of embedding degrees 4 and 6, ...
(4). C : G−\{1}→{0, 1}2 × Fpm h h(pm)2. → (i, T r4/1(g)). (3). Page 7. Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps. 25. D : {0, 1} ...
Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps · List of references · Publications that cite this publication.
It is shown how the pairing values over characteristic two fields can be compressed by a factor of 4, and several algorithms for performing exponentiation ...
Jul 8, 2010 · In this paper, we show how the pairing values over characteristic two fields can be compressed by a factor of 4.
Missing: Maps. | Show results with:Maps.
Our compression and decompression functions can be computed at a negligible cost. In particular, our techniques lead to very efficient exponentiation algorithms ...
Hanatani, “Factor-4 and 6 (De)compression for Values of Pairing using Trace Maps,” Pairing 2012, 2012. compression. Key size can be reduced up to 1/6. Page 3 ...