Fixed argument pairings
From MaRDI portal
Publication:3584977
DOI10.1007/978-3-642-14712-8_6zbMATH Open1285.94050OpenAlexW1509154870MaRDI QIDQ3584977FDOQ3584977
Authors: Craig Costello, Douglas Stebila 
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
Recommendations
- Computing fixed argument pairings with the elliptic net algorithm
- A variant of Miller's formula and algorithm
- Further refinement of pairing computation based on Miller's algorithm
- Avoiding full extension field arithmetic in pairing computations
- Efficient Algorithm for Tate Pairing of Composite Order
Cited In (5)
- CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs
- Match me if you can: matchmaking encryption and its applications
- Computing fixed argument pairings with the elliptic net algorithm
- On the efficient implementation of pairing-based protocols
- Polymath: Groth16 is not the limit
This page was built for publication: Fixed argument pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584977)
