International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Neal Koblitz
Download:
URL: http://eprint.iacr.org/2010/227
Search ePrint
Search Google
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$.
BibTeX
@misc{eprint-2010-23128,
  title={A Security Weakness in Composite-Order Pairing-Based Protocols with Imbedding Degree $k>2$},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / pairing-based protocol, imbedding degree},
  url={http://eprint.iacr.org/2010/227},
  note={ koblitz@math.washington.edu 14722 received 22 Apr 2010},
  author={Neal Koblitz},
  year=2010
}