Paper 2010/227 Original: eprint.iacr.org/2010/227 ↗
A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$
Abstract
In this note we describe a security weakness in pairing-based protocols when the group order is composite and the imbedding degree $k$ is greater than $2$.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-04-28: last updated
- 2010-04-28: published
- Short URL
- https://ia.cr/2010/227
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/227,
author = {Neal Koblitz},
title = {A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/227},
year = {2010},
url = {https://eprint.iacr.org/2010/227}
}