Welcome to the resource topic for 2008/019
Title:
Computing Pairings Using x-Coordinates Only
Authors: Steven D. Galbraith, Xibin Lin
Abstract:To reduce bandwidth in elliptic curve cryptography one can transmit only x-coordinates of points (or x-coordinates together with an extra bit). For further computation using the points one can either recover the y-coordinates by taking square roots or one can use point multiplication formulae which use x-coordinates only. We consider how to efficiently use point compression in pairing-based cryptography. We give a method to compute compressed Weil pairings using x-coordinates only. We also show how to compute the compressed Tate and ate pairings using only one y-coordinate. Our methods are more efficient than taking square roots when the embedding degree is small. We implemented the algorithms in the case of embedding degree 2 curves over \F_p where p \equiv 3 \pmod{4} and found that our methods are 10-15\% faster than the analogous methods using square roots.
ePrint: https://eprint.iacr.org/2008/019
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .