Implementing optimized pairings with elliptic nets

DOI10.1007/s11432-013-4840-7zbMath1357.94074OpenAlexW2088749147MaRDI QIDQ893619

Yanfeng Qi, Mao-Zhi Xu, Dongmei Ni, Bao-An Guo, Chun-Ming Tang

Publication date: 20 November 2015

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4840-7

zbMATH Keywords

elliptic curvespairingspairing-based cryptographyMiller's algorithmelliptic nets

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Efficient identity-based threshold decryption scheme from bilinear pairings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• A taxonomy of pairing-friendly elliptic curves
• Computationally-Fair Group and Identity-Based Key-Exchange
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• Sufficient Condition for Identity-Based Authenticated Key Exchange Resilient to Leakage of Secret Keys
• FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
• The Eta Pairing Revisited
• Integer Variable χ–Based Ate Pairing
• Advances in Cryptology - EUROCRYPT 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• The Tate Pairing Via Elliptic Nets
• Optimised Versions of the Ate and Twisted Ate Pairings
• Memoir on Elliptic Divisibility Sequences

This page was built for publication: Implementing optimized pairings with elliptic nets