Exponentiating in Pairing Groups

Selected Areas in Cryptography 2013 (SAC 2013) |

Published by Springer

We study exponentiations in pairing groups for the most common security levels and show that, although the Weierstrass model is preferable for pairing computation, it can be worthwhile to map to alternative curve representations for the non-pairing group operations in protocols.