Pages that link to "Item:Q3392904"

The following pages link to On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904):

Displaying 14 items.

• Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
• Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
• A survey of fault attacks in pairing based cryptography (Q892296) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
• Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
• Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
• Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
• Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
• An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
• An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
• Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
• Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
• CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)