Design and Analysis of Pairing-Friendly Elliptic Curves for Cryptographic Primitives
Mahender Kumar

TL;DR
This paper analyzes pairing-friendly elliptic curves for cryptography, proposing new schemes to improve security and efficiency in resource-limited environments, and addressing limitations in existing pairing-based cryptographic applications.
Contribution
It introduces a comprehensive framework for constructing and evaluating pairing-friendly elliptic curves and proposes escrow-free identity-based encryption and signature schemes.
Findings
Evaluated security of various pairing-friendly curves
Proposed escrow-free IBE and IBS schemes
Addressed key escrow and security issues in pairing cryptography
Abstract
Elliptic curve cryptography (ECC) is a remarkable mathematical tool that offers the same level of security as traditional public-key cryptography (PKC) with a significantly smaller key size and lower computational requirements. The use of pairing on elliptic curves has emerged as a vibrant field of research that provides enhanced security measures for the next generation of cryptographic systems. This thesis explores using ECC and Pairing-Based Cryptosystems (PBC) as effective mathematical tools for achieving high-security levels with minimal key size and computation cost. Specifically, the research aims to analyze Pairing-Friendly Elliptic Curves (PF-EC) and their practicality in resource-constrained environments. It proposes solutions to some of the limitations of existing applications of pairing-based cryptography. The thesis begins by presenting a comprehensive framework for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Cryptography and Data Security · Chaos-based Image/Signal Encryption
