Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects (Q3593087): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FGb / 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.1007/11761679_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1806793453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison Between XL and Gröbner Basis Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding and Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attacking the Affine Parts of SFLASH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343439 / rank
 
Normal rank

Latest revision as of 10:12, 27 June 2024

scientific article
Language Label Description Also known as
English
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
scientific article

    Statements

    Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects (English)
    0 references
    0 references
    0 references
    24 September 2007
    0 references
    Public-key cryptography
    0 references
    cryptanalysis
    0 references
    isomorphism of polynomials (IP)
    0 references
    Gröbner bases
    0 references
    \(F_{5}\) algorithm
    0 references

    Identifiers