Cryptology ePrint Archive: Report 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$.

Category / Keywords: public-key cryptography / pairing-based protocol, imbedding degree

Date: received 22 Apr 2010

Contact author: koblitz at math washington edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20100428:135058 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]