Generating Pairing-Friendly Curves for Required Security Levels
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 104 === In recent years, more and more applications based on bilinear pairing computation have been constructed, like Public Key Encryption with Keyword Search, Identity-Based Encryption, and their extension studies. The very first issue is to pick up a pairing-frien...
Main Authors: | Chang, Yi-Tang, 張奕棠 |
---|---|
Other Authors: | Chen, Rong-Jaye |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/75577782243991065659 |
Similar Items
-
Heuristics on pairing-friendly elliptic curves
by: Boxall John
Published: (2012-10-01) -
Generating pairing-friendly elliptic curve parameters using sparse families
by: Fotiadis Georgios, et al.
Published: (2018-06-01) -
Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures.
by: Maocai Wang, et al.
Published: (2016-01-01) -
On the ρ-values of complete families of pairing-friendly elliptic curves
by: Okano Keiji
Published: (2012-12-01) -
On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
by: Sha Min
Published: (2014-12-01)