Search

This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field ℚ (ζ 11 ) , $ \mathbb{Q}\left({{\zeta }_{11}} \right), $ where 11 is a primitive 11th root of unity. It extends an earlier algorithm due to Caranay and Scheidler (Int. J. Number Theory, 2010) for the 7th-power residue symbol. The new algorithm finds applications in the implementation of certain cryptographic schemes. [ABSTRACT FROM AUTHOR]

Bilinear pairings derived from supersingular elliptic curves of embedding degrees 4 and 6 over finite fields 2 m and 3 m, respectively, have been used to implement pairing-based cryptographic protocols. The pairing values lie in certain prime-order subgroups of the cyclotomic subgroups of orders 22 m + 1 and 32 m - 3 m + 1, respectively, of the multiplicative groups and . It was previously known how to compress the pairing values over characteristic two fields by a factor of 2, and the pairing values over characteristic three fields by a factor of 6. In this paper, we show how the pairing values over characteristic two fields can be compressed by a factor of 4. Moreover, we present and compare several algorithms for performing exponentiation in the prime-order subgroups using the compressed representations. In particular, in the case where the base is fixed, we expect to gain at least a 54% speed up over the fastest previously known exponentiation algorithm that uses factor-6 compressed representations. [ABSTRACT FROM AUTHOR]