Implementing optimized pairings with elliptic nets

DOI10.1007/S11432-013-4840-7zbMATH Open1357.94074OpenAlexW2088749147MaRDI QIDQ893619FDOQ893619

Authors: Dongmei Ni, Maozhi Xu, Yanfeng Qi, Chun-Ming Tang, Bao-an Guo 

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

Recommendations

• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
• The Tate Pairing Via Elliptic Nets
• Cryptographic pairings based on elliptic nets
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves

zbMATH Keywords

elliptic curvespairing-based cryptographyMiller's algorithmelliptic netspairings

Mathematics Subject Classification ID

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

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Faster explicit formulas for computing pairings over ordinary curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Title not available (Why is that?)
• The Eta Pairing Revisited
• Integer Variable χ–Based Ate Pairing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Memoir on Elliptic Divisibility Sequences
• Optimised Versions of the Ate and Twisted Ate Pairings
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
• The Tate Pairing Via Elliptic Nets
• FPGA implementation of pairings using residue number system and lazy reduction
• Computationally-fair group and identity-based key-exchange
• Sufficient condition for identity-based authenticated key exchange resilient to leakage of secret keys

Cited In (6)

• Title not available (Why is that?)
• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
• An Improvement of the Elliptic Net Algorithm
• Efficient identity-based threshold decryption scheme from bilinear pairings
• Cryptographic pairings based on elliptic nets

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

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