The following pages link to (Q4474195):
Displayed 22 items.
- An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications (Q541470) (← links)
- A pairing-based publicly verifiable secret sharing scheme (Q545465) (← links)
- Fully collusion-resistant traitor tracing scheme with shorter ciphertexts (Q548093) (← links)
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology (Q814764) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield (Q1433966) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Formulae for arithmetic on genus 2 hyperelliptic curves (Q1772238) (← links)
- Supersingular hyperelliptic curves of genus 2 over finite fields (Q1774865) (← links)
- Koblitz curve cryptosystems (Q1779327) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
- Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- A New Method for Constructing Pairing-Friendly Abelian Surfaces (Q3059658) (← links)
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2 (Q3519561) (← links)
- Easy Decision Diffie-Hellman Groups (Q4827630) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- An Analysis of the Vector Decomposition Problem (Q5445460) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)