A Brief History Of Pairings

ARITHMETIC OF FINITE FIELDS, WAIFI 2016（2016）

引用 3|浏览0

暂无评分

摘要

Pairings are a relatively new tool in cryptography. Recent progress on the attack algorithms have changed the security estimations. We make a list of pairing families and explain their advantages but also their weaknesses.

查看译文

关键词

Elliptic Curve, Elliptic Curf, Discrete Logarithm, Discrete Logarithm Problem, Asymptotic Complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要