Efficient ideal reduction in quadratic fields
From MaRDI portal
Recommendations
Cited in
(15)- scientific article; zbMATH DE number 4130460 (Why is no real title available?)
- Two efficient algorithms for the computation of ideal sums in quadratic orders
- A New Look at an Old Equation
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- scientific article; zbMATH DE number 4110785 (Why is no real title available?)
- scientific article; zbMATH DE number 1273650 (Why is no real title available?)
- Reduction of Binary Cubic and Quartic Forms
- Improving ideals by means of quadratic transformations
- A Note on NUCOMP
- scientific article; zbMATH DE number 2086879 (Why is no real title available?)
- scientific article; zbMATH DE number 799022 (Why is no real title available?)
- Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
- Efficient reduction of large divisors on hyperelliptic curves
- Reduced ideals from the reduction algorithm
- Smooth twins for cryptographic applications from Pell equations
This page was built for publication: Efficient ideal reduction in quadratic fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5471355)