On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
From MaRDI portal
Recommendations
Cited in
(26)- Equivalences between elliptic curves and real quadratic congruence function fields
- Some Computational Results on a Problem Concerning Powerful Numbers
- A fast, rigorous technique for computing the regulator of a real quadratic field
- A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
- Computation of Real Quadratic Fields with Class Number One
- A parallel version of the continued fraction integer factoring algorithm
- The infrastructure of a global field of arbitrary unit rank
- A key-exchange protocol using real quadratic fields
- Quadratic Residue Covers for Certain Real Quadratic Fields
- Cryptography based on number fields with large regulator
- Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
- On a determination of real quadratic fields of class number one and related continued fraction period length less than 25
- Continued fractions and parallel SQUFOF
- Use of the rabinowitsch polynomial to determine the class groups of a real quadratic field
- An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
- On the divisor function and class numbers of real quadratic fields. II
- scientific article; zbMATH DE number 3885978 (Why is no real title available?)
- Some remarks concerning the complexity of computing class groups of quadratic fields
- Affirmative solution of a conjecture related to a sequence of Shanks
- On the divisor function and class numbers of real quadratic fields. III
- Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
- The continued fraction algorithm and regulator for quadratic function fields of characteristic 2
- The palindromic index -- A measure of ambiguous cycles of reduced ideals without any ambiguous ideal in real quadratic orders
- A New Look at an Old Equation
- Quadratic irrationals, ambiguous classes and symmetry in real quadratic fields
- Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than \(100 000 000 000\)
This page was built for publication: On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726319)