LiDIA

swMATH518MaRDI QIDQ13274FDOQ13274

Author name not available (Why is that?)

Cited In (50)

• Title not available (Why is that?)
• A fast, rigorous technique for computing the regulator of a real quadratic field
• Exact computation of the medial axis of a polyhedron
• A mostly-copying collector component for class templates
• Hyperelliptic Simple Factors of J₀(N) with Dimension at Least 3
• Non-standard approaches to integer programming
• A Problem Concerning a Character Sum
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• Fast convolutions meet Montgomery
• Computing the $\ell $-power torsion of an elliptic curve over a finite field
• On random walks for Pollard's rho method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic. II: Computation
• A method for accurate computation of the rotation and the twist numbers of invariant circles
• New quadratic polynomials with high densities of prime values
• Cryptography based on number fields with large regulator
• Determining the $2$-Sylow subgroup of an elliptic curve over a finite field
• Scalar multiplication in elliptic curve libraries
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Recent developments in primality proving
• Title not available (Why is that?)
• Compact representation of quadratic integers and integer points on some elliptic curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing discrete logarithms with the parallelized kangaroo method.
• On the efficient generation of prime-order elliptic curves
• Finding the Eigenvalue in Elkies' Algorithm
• Title not available (Why is that?)
• Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
• A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$
• NZMATH 1.0
• Title not available (Why is that?)
• Efficient and exact manipulation of algebraic points and curves
• An algorithm to compute volcanoes of 2-isogenies of elliptic curves over finite fields
• Sieving in Function Fields
• Heuristics on lattice basis reduction in practice
• A new public-key cryptosystem over a quadratic order with quadratic decryption time.
• On some computational problems in finite abelian groups
• Title not available (Why is that?)
• Remarks on Gödel's code as a hash function
• Explicit resolutions of cubic cusp singularities
• Applying sieving to the computation of quadratic class groups
• A space efficient algorithm for group structure computation
• Functional programming concepts and straight-line programs in computer algebra
• PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
• The Size of the Fundamental Solutions of Consecutive Pell Equations
• Opal: a system for computing noncommutative Gröbner bases
• The parallelized Pollard kangaroo method in real quadratic function fields
• Computing Heeke Eigenvalues Below the Cohomologieal Dimension

This page was built for software: LiDIA