A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$

Neal Koblitz

Paper 2010/227

A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$

Neal Koblitz

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 PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: pairing-based protocol imbedding degree
Contact author(s): koblitz @ math washington edu
History: 2010-04-28: received
Short URL: https://ia.cr/2010/227
License: CC BY

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}
}