On enumeration of polynomial equivalence classes

DOI10.1007/S11425-011-4355-XMaRDI QIDQ2392938zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303122 (Why is no real title available?)
• scientific article; zbMATH DE number 671683 (Why is no real title available?)
• scientific article; zbMATH DE number 1107703 (Why is no real title available?)
• scientific article; zbMATH DE number 2009947 (Why is no real title available?)
• scientific article; zbMATH DE number 1418284 (Why is no real title available?)
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• On enumeration of polynomial equivalence classes and their application to MPKC
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Progress in Cryptology - INDOCRYPT 2003
• Progress in Cryptology – Mycrypt 2005
• Public Key Cryptography - PKC 2005
• Unbalanced Oil and Vinegar Signature Schemes

Cited in

(8)

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

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)