scientific article; zbMATH DE number 1273650
From MaRDI portal
Publication:4237380
zbMath1019.11505MaRDI QIDQ4237380
Publication date: 14 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items (14)
Towards faster polynomial-time lattice reduction ⋮ InfoMod: a visual and computational approach to Gauss' binary quadratic forms ⋮ Fast practical lattice reduction through iterated compression ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ A low-memory algorithm for finding short product representations in finite groups. ⋮ A Subexponential Algorithm for Evaluating Large Degree Isogenies ⋮ On Schönhage's algorithm and subquadratic integer gcd computation ⋮ A linear algorithm for integer programming in the plane ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Short vectors of planar lattices via continued fractions
This page was built for publication:
