The following pages link to Cryptography and Coding (Q5897510):
Displaying 24 items.
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- The pairing computation on Edwards curves (Q460158) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one (Q555157) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
- SEMD: secure and efficient message dissemination with policy enforcement in VANET (Q736616) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles (Q2377064) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
- Heuristics of the Cocks-Pinch method (Q2437964) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
- Efficient Multiplication in Finite Field Extensions of Degree 5 (Q3011913) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
