The following pages link to (Q3139838):
Displaying 50 items.
- Automorphic properties of generating functions for generalized odd rank moments and odd Durfee symbols (Q3095775) (← links)
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme (Q3104682) (← links)
- Binary Kloosterman Sums with Value 4 (Q3104685) (← links)
- Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves (Q3104704) (← links)
- Algorithme de Bareiss, algorithme des sous-résultants (Q3124402) (← links)
- Computing canonical heights with little (or no) factorization (Q3127334) (← links)
- Computation of Galois groups over function fields (Q3127336) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test (Q3147182) (← links)
- Computation of class numbers of quadratic number fields (Q3147183) (← links)
- Commutative images of rational languages and the Abelian kernel of a monoid (Q3149083) (← links)
- Computing a lower bound for the canonical height on elliptic curves over number fields (Q3160749) (← links)
- Computing totally positive algebraic integers of small trace (Q3168738) (← links)
- The Erdős–Moser equation $1^{k}+2^{k}+\dots+(m-1)^{k}=m^{k}$ revisited using continued fractions (Q3168749) (← links)
- Computational Identification of Irreducible State-Spaces for Stochastic Reaction Networks (Q3176263) (← links)
- An Attack on the Zhou-Fan-Li Authenticated Multiple-Key Agreement Protocol (Q3183952) (← links)
- Evaluating Igusa functions (Q3189460) (← links)
- A search for Wilson primes (Q3189466) (← links)
- Jacobian Versus Infrastructure in Split Hyperelliptic Curves (Q3294877) (← links)
- Computing the ideal class monoid of an order (Q3304706) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- (Q3388324) (← links)
- EMBEDDING FINITE FIELDS INTO ELLIPTIC CURVES (Q3388635) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Quantum algorithms for number fields (Q3423180) (← links)
- Classification of eight-dimensional perfect forms (Q3432119) (← links)
- Computing points of bounded height in projective space over a number field (Q3450044) (← links)
- Generating random factored Gaussian integers, easily (Q3450047) (← links)
- Closedness of Integer Hulls of Simple Conic Sets (Q3462546) (← links)
- Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields (Q3502733) (← links)
- Abelian Subgroups of Garside Groups (Q3510076) (← links)
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation (Q3511182) (← links)
- Fast Point Multiplication on Elliptic Curves without Precomputation (Q3519550) (← links)
- Decidable Compositions of O-Minimal Automata (Q3540076) (← links)
- Computing Omega-Limit Sets in Linear Dynamical Systems (Q3543335) (← links)
- Choosing the correct elliptic curve in the CM method (Q3584790) (← links)
- Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III (Q3584852) (← links)
- Efficient CM-constructions of elliptic curves over finite fields (Q3592699) (← links)
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography (Q3600496) (← links)
- Transcendental lattices and supersingular reduction lattices of a singular 𝐾3 surface (Q3605850) (← links)
- Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable (Q3623063) (← links)
- Exponent Recoding and Regular Exponentiation Algorithms (Q3637149) (← links)
- In Praise of Numerical Computation (Q3644734) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A space efficient algorithm for group structure computation (Q4210962) (← links)
- The lifting of an exponential sum to a cyclic algebraic number field of prime degree (Q4211870) (← links)
- Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems (Q4216666) (← links)
- Analysis of PSLQ, an integer relation finding algorithm (Q4221985) (← links)
- Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms (Q4227904) (← links)
- The S<sub>5</sub>Extensions of Degree 6 with Minimum Discriminant (Q4228027) (← links)
