An Improvement of the Elliptic Net Algorithm

DOI10.1109/TC.2015.2498556MaRDI QIDQ2985316zbMATH OpenFDO

Authors Bing-Long Chen, Chang-An Zhao

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2015.2498556

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Computing fixed argument pairings with the elliptic net algorithm
• scientific article; zbMATH DE number 1283878
• scientific article; zbMATH DE number 1117802
• Rough Sets and Current Trends in Computing
• Implementing optimized pairings with elliptic nets
• scientific article; zbMATH DE number 1088246
• scientific article; zbMATH DE number 279596
• An improved LLL algorithm
• An Improvement of Rosenfeld-Gröbner Algorithm
• Algorithmic Improvements to the Method of Martel and Aouni

Cited in

(2)

• Biextensions in pairing-based cryptography
• Computing pairings on elliptic curves with embedding degree two via biextensions

This page was built for publication: An Improvement of the Elliptic Net Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985316)