Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (Q3160743): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factoring polynomials over special finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted primes without large prime factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-witnessing polynomial-time complexity and prime factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials and primitive elements for special primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Isomorphisms Between Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramanujan-Nagell equations with many solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials modulo special primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the deterministic complexity of factoring polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothness and factoring polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic version of Pollard’s $p-1$ algorithm / rank
 
Normal rank

Latest revision as of 07:05, 3 July 2024

scientific article
Language Label Description Also known as
English
Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝
scientific article

    Statements

    Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (English)
    0 references
    0 references
    8 October 2010
    0 references
    prime finite field
    0 references
    factorization
    0 references
    polynomials
    0 references
    roots
    0 references
    derandomization
    0 references

    Identifiers