Pages that link to "Item:Q1189509"

The following pages link to Primality testing and Abelian varieties over finite fields (Q1189509):

Displaying 29 items.

• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
• Primality testing through algebraic groups (Q1047901) (← links)
• Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
• Elliptic periods and primality proving (Q1762314) (← links)
• On counting and generating curves over small finite fields (Q1827569) (← links)
• Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
• Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\) (Q2580254) (← links)
• Optimal testing of multivariate polynomials over small prime fields (Q2840981) (← links)
• Book review of: Inevitable randomness in discrete mathematics, by József Beck (Q2849010) (← links)
• A primality test algorithm using supersingular elliptic curves (Q3017081) (← links)
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
• Primality testing using elliptic curves (Q3158545) (← links)
• A Hyperelliptic Smoothness Test, II (Q3365309) (← links)
• Proving primality in essentially quartic random time (Q3420438) (← links)
• Diffie-Hellman Oracles (Q3452357) (← links)
• Primality testing (Q3974091) (← links)
• Computing the Mordell-Weil Rank of Jacobians of Curves of Genus Two (Q4201485) (← links)
• Pairing-Friendly Primes for Abelian Varieties (Q4589253) (← links)
• (Q4684637) (← links)
• It is easy to determine whether a given integer is prime (Q4829920) (← links)
• (Q4831122) (← links)
• Principally Polarized Ordinary Abelian Varieties Over Finite Fields (Q4846032) (← links)
• Some results on pseudosquares (Q4878556) (← links)
• Sharpening ``Primes is in P'' for a large family of numbers (Q5315434) (← links)
• Abelian Surfaces over Finite Fields as Jacobians (Q5472029) (← links)
• The computational complexity of recognizing permutation functions (Q5917358) (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
• Counting points on curves and Abelian varieties over finite fields (Q5945287) (← links)
• Interactions of computational complexity theory and mathematics (Q6198725) (← links)