Pairing-based cryptography on elliptic curves

DOI10.1007/s11786-018-0347-3zbMath1432.94140OpenAlexW2810305017MaRDI QIDQ1616164

Juan G. Tena, Daniel Sadornil, Josep M. Miret Biosca

Publication date: 1 November 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-018-0347-3

zbMATH Keywords

elliptic curvespairingsWeil pairingidentity-based cryptographyembedding degreepairing-friendly elliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Uses Software

• ECPP

Cites Work

• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Elliptic curves suitable for pairing based cryptography
• Elliptic curves withj= 0,1728 and low embedding degree
• Identity-Based Cryptosystems and Signature Schemes
• Elliptic Curves and Primality Proving
• New directions in cryptography
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Elliptic Curve Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairing-based cryptography on elliptic curves