Delaying mismatched field multiplications in pairing computations

DOI10.1007/978-3-642-13797-6_14MaRDI QIDQ3578474zbMATH OpenOpenAlexFDO

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

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://eprints.qut.edu.au/34178/1/c34178.pdf

zbMATH Keywords

Miller's algorithmTate pairingfinite field arithmeticpairingsate pairing

Mathematics Subject Classification ID

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

Recommendations

• Avoiding full extension field arithmetic in pairing computations
• A variant of Miller's formula and algorithm
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Faster explicit formulas for computing pairings over ordinary curves
• Implementing cryptographic pairings

Cited in

(1)

• Avoiding full extension field arithmetic in pairing computations

Describes a project that uses

Uses Software

• EFD

This page was built for publication: Delaying mismatched field multiplications in pairing computations

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