Fixed Argument Pairings

DOI10.1007/978-3-642-14712-8_6zbMath1285.94050OpenAlexW1509154870MaRDI QIDQ3584977

Douglas Stebila, Craig Costello

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/33711/1/c33711.pdf

zbMATH Keywords

Tate pairingMiller's algorithmate pairingprecomputationPairings

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs ⋮ Match me if you can: matchmaking encryption and its applications ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ Computing fixed argument pairings with the elliptic net algorithm

This page was built for publication: Fixed Argument Pairings