On enumeration of polynomial equivalence classes

DOI10.1007/S11425-011-4355-XzbMATH Open1279.94124OpenAlexW2269124134MaRDI QIDQ2392938FDOQ2392938

Authors: Tianze Wang, Dongdai Lin 

Publication date: 5 August 2013

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-011-4355-x

Recommendations

• A method for counting the number of polynomial equivalence classes
• On enumeration of polynomial equivalence classes and their application to MPKC
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Progress in Cryptology - INDOCRYPT 2003
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case

zbMATH Keywords

finite geometryenumerative problemisomorphism of polynomials

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2003
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Title not available (Why is that?)
• On enumeration of polynomial equivalence classes and their application to MPKC
• Unbalanced Oil and Vinegar Signature Schemes
• Progress in Cryptology – Mycrypt 2005
• Public Key Cryptography - PKC 2005
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Title not available (Why is that?)
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem

Cited In (9)

• On connection sequence for equivalent polynomial sets
• A general framework for enumerating equivalence classes of solutions
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• New insight into the isomorphism of polynomial problem IP1S and its use in cryptography
• Sieve method for polynomial linear equivalence
• On enumeration of polynomial equivalence classes and their application to MPKC
• Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
• A method for counting the number of polynomial equivalence classes
• On enumerating monomials and other combinatorial structures by polynomial interpolation

This page was built for publication: On enumeration of polynomial equivalence classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392938)