The following pages link to Cryptography and Coding (Q5897510):
Displaying 42 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)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function (Q3503871) (← links)
- The number field sieve for integers of low weight (Q3584792) (← links)
- Security Analysis of the Strong Diffie-Hellman Problem (Q3593084) (← links)
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (Q3593112) (← links)
- Pairing Computation on Twisted Edwards Form Elliptic Curves (Q3600505) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- ECM on Graphics Cards (Q3627453) (← links)
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? (Q3634337) (← links)
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography (Q3634510) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Another Approach to Pairing Computation in Edwards Coordinates (Q5504639) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- On cycles of pairing-friendly abelian varieties (Q6653047) (← links)
