Pages that link to "Item:Q5902377"
From MaRDI portal
The following pages link to Advances in Cryptology - ASIACRYPT 2003 (Q5902377):
Displaying 38 items.
- Multibase scalar multiplications in cryptographic pairings (Q300879) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) (Q868380) (← links)
- A survey of fault attacks in pairing based cryptography (Q892296) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- Closed formulae for the Weil pairing inversion (Q938771) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five (Q957691) (← links)
- Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- A refinement of Müller's cube root algorithm (Q1994923) (← links)
- New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis (Q2446580) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- An Efficient ID-Based Proxy Signature Scheme from Pairings (Q3600319) (← links)
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms (Q3600506) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← 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)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- Pairing-Based Cryptography (Q5050174) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ (Q5452256) (← links)
- Escrow-free encryption supporting cryptographic workflow (Q5492129) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
