Abstract
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we show how to compress pairing values, how to couple this technique with that of point compression, and how to benefit from the compressed representation to speed up exponentiations involving pairing values, as required in many pairing based protocols. © International Association for Cryptologic Research 2004.
Author supplied keywords
Cite
CITATION STYLE
Scott, M., & Barreto, P. S. L. M. (2004). Compressed Pairings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3152, 140–156. https://doi.org/10.1007/978-3-540-28628-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
