The following pages link to (Q4237380):
Displaying 14 items.
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- InfoMod: a visual and computational approach to Gauss' binary quadratic forms (Q2154493) (← links)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- Reduction of Binary Cubic and Quartic Forms (Q4252658) (← links)
- A Subexponential Algorithm for Evaluating Large Degree Isogenies (Q4931651) (← links)
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом (Q4958988) (← links)
- On Schönhage's algorithm and subquadratic integer gcd computation (Q5429518) (← links)
