Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1272335
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ivan B. Damgård / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2004.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052806472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast Euclidean algorithm for Gaussian integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean algorithm in algebraic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for computing the Jacobi symbol / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public-key cryptosystem utilizing cyclotomic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational problems associated with Racah algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of the biquadratic residue symbol. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Solution of x 3 + Dy 3 = 1 / rank
 
Normal rank

Latest revision as of 11:19, 27 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
scientific article

    Statements

    Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (English)
    0 references
    19 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    gcd
    0 references
    cubic residuosity
    0 references
    0 references