scientific article; zbMATH DE number 1273650

MaRDI QIDQ4237380zbMATH OpenFDO

Authors Arnold Schönhage

Publication date 14 March 2000

zbMATH Keywords

algorithmbinary quadratic formscomposition of formsintegral coefficientsreduction

Mathematics Subject Classification ID

Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 4110785
• scientific article; zbMATH DE number 1852135
• Efficient ideal reduction in quadratic fields
• Reduction theory of binary forms

Cited in

(28)

• Short vectors of planar lattices via continued fractions
• A linear algorithm for integer programming in the plane
• Fast computation of the biquadratic residue symbol.
• Fast reduction of algebraic lattices over cyclotomic fields
• Towards faster polynomial-time lattice reduction
• InfoMod: a visual and computational approach to Gauss' binary quadratic forms
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• The complexity of class polynomial computation via floating point approximations
• Two efficient algorithms for the computation of ideal sums in quadratic orders
• scientific article; zbMATH DE number 4110785 (Why is no real title available?)
• Reduction of Binary Cubic and Quartic Forms
• A Note on NUCOMP
• Absolute reduction of binary forms
• Solving quadratic equations using reduced unimodular quadratic forms
• scientific article; zbMATH DE number 2086879 (Why is no real title available?)
• scientific article; zbMATH DE number 1852135 (Why is no real title available?)
• scientific article; zbMATH DE number 799022 (Why is no real title available?)
• Smallest Reduction Matrix of Binary Quadratic Forms
• A subexponential algorithm for evaluating large degree isogenies
• Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
• On Schönhage's algorithm and subquadratic integer gcd computation
• Efficient ideal reduction in quadratic fields
• Reduction theory of binary forms
• Fast practical lattice reduction through iterated compression
• A low-memory algorithm for finding short product representations in finite groups.
• Fast square-free decomposition of integers using class groups
• Towards a modern LLL implementation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4237380)