Pages that link to "Item:Q3506394"
From MaRDI portal
The following pages link to On Compressible Pairings and Their Computation (Q3506394):
Displaying 16 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Compressions of compact tuples (Q1715849) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Higher-Order Side Channel Security and Mask Refreshing (Q2946888) (← links)
- Efficient Multiplication in Finite Field Extensions of Degree 5 (Q3011913) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
- (Q3352971) (← links)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904) (← links)
- (Q4537913) (← links)
- Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps (Q4912486) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311564) (← links)
- Pairings in rank-1 constraint systems (Q6535081) (← links)
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup (Q6619943) (← links)
