### Reducing Complexity of Pairing Comparisons using Polynomial Evaluation

##### Abstract

We propose a new method for reducing complexity of the pairing comparisons based on polynomials. Thought the construction introduces uncertainty into (usually deterministic) checks, it is easily quantifiable and in most cases extremely small. The application to CL-LRSW signature verification under n messages and group order q allows to reduce the number of computed pairings from 4n down to just 4, while the introduced uncertainty is just (2n-1)/q.

Available format(s)
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
elliptic curve cryptosystemimplementationpolynomialsbilinear maps
Contact author(s)
marcin slowik @ pwr edu pl
History
2018-11-19: revised
See all versions
Short URL
https://ia.cr/2018/523

CC BY

BibTeX

@misc{cryptoeprint:2018/523,
author = {Adam Bobowski and Marcin Słowik},
title = {Reducing Complexity of Pairing Comparisons using Polynomial Evaluation},
howpublished = {Cryptology ePrint Archive, Paper 2018/523},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/523}},
url = {https://eprint.iacr.org/2018/523}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.