Pages that link to "Item:Q3701545"
From MaRDI portal
The following pages link to Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p (Q3701545):
Displaying 50 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Nonlinearities in elliptic curve authentication (Q296311) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Analysis of the fault attack ECDLP over prime field (Q410803) (← links)
- Two kinds of division polynomials for twisted Edwards curves (Q429775) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Counting curves and their projections (Q677992) (← links)
- A new generalization of the KMOV cryptosystem (Q721553) (← links)
- Uniform encodings to elliptic curves and indistinguishable point representation (Q782846) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- A quasi quadratic time algorithm for hyperelliptic curve point counting (Q874910) (← links)
- Factoring polynomials modulo special primes (Q909466) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Elliptic Gauss sums and applications to point counting (Q979143) (← links)
- Point counting on reductions of CM elliptic curves (Q1035582) (← links)
- Primality of the number of points on an elliptic curve over a finite field (Q1086273) (← links)
- The existence of infinitely many supersingular primes for every elliptic curve over \(\mathbb Q\). (Q1094491) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
- Computing rational cohomology and Hecke eigenvalues for Bianchi groups (Q1183274) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- The Pohlig-Hellman method generalized for group structure computation (Q1300626) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field (Q1313211) (← links)
- Zeta functions, one-way functions, and pseudorandom number generators. (Q1362085) (← links)
- Constructive and destructive facets of Weil descent on elliptic curves (Q1596367) (← links)
- Taking cube roots in \(\mathbb Z_{m}\) (Q1614110) (← links)
- On division polynomial PIT and supersingularity (Q1623917) (← links)
- Super-Golden-Gates for \(PU(2)\) (Q1701020) (← links)
- Frobenius elements in Galois representations with \(\mathrm{SL}_{n}\) image (Q1708075) (← links)
- Injective encodings to binary ordinary elliptic curves (Q1726692) (← links)
- \(p\)-adic properties of division polynomials and elliptic divisibility sequences (Q1779179) (← links)
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests (Q1820186) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 (Q1826275) (← links)
- Computing zeta functions of Artin-Schreier curves over finite fields. II (Q1827573) (← links)
- Some computational problems of cryptographic significance concerning elliptic curves over rings (Q1854282) (← links)
- Fast computation of canonical lifts of elliptic curves and its application to point counting. (Q1867482) (← links)
- Counting points on elliptic curves over finite fields (Q1909875) (← links)
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects (Q1909876) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- On the representation of the number of integral points of an elliptic curve modulo a prime number (Q2017998) (← links)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
- Reprint of: Endomorphism rings of reductions of Drinfeld modules (Q2055940) (← links)
- Computing zeta functions of algebraic curves using Harvey's trace formula (Q2100584) (← links)
- Counting points on smooth plane quartics (Q2100591) (← links)
- Pseudorandom vector generation using elliptic curves and applications to Wiener processes (Q2101189) (← links)
