Avoiding full extension field arithmetic in pairing computations

DOI10.1007/978-3-642-12678-9_13zbMATH Open1284.11160OpenAlexW1535347796MaRDI QIDQ3558313FDOQ3558313

Authors: Craig Costello, Kenneth Koon-Ho Wong, Colin A. Boyd, Juan Manuel González Nieto 

Publication date: 4 May 2010

Published in: Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/34176/1/c34176.pdf

Recommendations

• Delaying mismatched field multiplications in pairing computations
• A variant of Miller's formula and algorithm
• Faster explicit formulas for computing pairings over ordinary curves
• Implementing cryptographic pairings
• Speeding up Ate pairing computation in affine coordinates

zbMATH Keywords

Miller's algorithmTate pairingpairingsate pairing

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Algebraic field extensions (12F05)

Cited In (2)

• Fixed argument pairings
• Delaying mismatched field multiplications in pairing computations

Uses Software

• EFD

This page was built for publication: Avoiding full extension field arithmetic in pairing computations

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