The following pages link to LiDIA (Q13274):
Displaying 50 items.
- Compact representation of quadratic integers and integer points on some elliptic curves (Q618675) (← links)
- Efficient and exact manipulation of algebraic points and curves (Q628007) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Recent developments in primality proving (Q1297591) (← links)
- Computing discrete logarithms with the parallelized kangaroo method. (Q1408372) (← links)
- Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders (Q1431610) (← links)
- Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic. II: Computation (Q1605763) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- A new public-key cryptosystem over a quadratic order with quadratic decryption time. (Q1976266) (← links)
- Exact computation of the medial axis of a polyhedron (Q2388543) (← links)
- An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields (Q2496009) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
- On random walks for Pollard's rho method (Q2701566) (← links)
- The Size of the Fundamental Solutions of Consecutive Pell Equations (Q2706543) (← links)
- (Q2739440) (← links)
- (Q2757234) (← links)
- The parallelized Pollard kangaroo method in real quadratic function fields (Q2781226) (← links)
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields (Q2871193) (← links)
- Computing the $\ell $-power torsion of an elliptic curve over a finite field (Q3055170) (← links)
- Remarks on Gödel’s code as a hash function (Q3075862) (← links)
- A fast, rigorous technique for computing the regulator of a real quadratic field (Q3592698) (← links)
- (Q3840174) (← links)
- A space efficient algorithm for group structure computation (Q4210962) (← links)
- Applying sieving to the computation of quadratic class groups (Q4235524) (← links)
- (Q4249351) (← links)
- (Q4249646) (← links)
- A Problem Concerning a Character Sum (Q4254562) (← links)
- On some computational problems in finite abelian groups (Q4372641) (← links)
- (Q4375624) (← links)
- (Q4375628) (← links)
- A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$ (Q4417184) (← links)
- Computing Heeke Eigenvalues Below the Cohomologieal Dimension (Q4526078) (← links)
- Opal: A system for computing noncommutative gröbner bases (Q4594240) (← links)
- Finding the Eigenvalue in Elkies' Algorithm (Q4736655) (← links)
- New quadratic polynomials with high densities of prime values (Q4780385) (← links)
- A mostly-copying collector component for class templates (Q4791101) (← links)
- Determining the $2$-Sylow subgroup of an elliptic curve over a finite field (Q4821056) (← links)
- (Q4920282) (← links)
- Explicit resolutions of cubic cusp singularities (Q4942792) (← links)
- Sieving in Function Fields (Q4947131) (← links)
- Scalar multiplication in elliptic curve libraries (Q5034943) (← links)
- PRECISE (Q5361589) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Heuristics on lattice basis reduction in practice (Q5463435) (← links)
- (Q5695477) (← links)
- NZMATH 1.0 (Q5747892) (← links)
- Hyperelliptic Simple Factors of J<sub>0</sub>(N) with Dimension at Least 3 (Q5756150) (← links)
- Cryptography based on number fields with large regulator (Q5939711) (← links)
- A method for accurate computation of the rotation and the twist numbers of invariant circles (Q5944264) (← links)
- On the efficient generation of prime-order elliptic curves (Q5962222) (← links)
