On enumeration of polynomial equivalence classes and their application to MPKC

DOI10.1016/J.FFA.2011.09.001zbMATH Open1251.94033OpenAlexW2150496909MaRDI QIDQ765801FDOQ765801

Authors: Jean-Charles Faugère, Ludovic Perret, Tianze Wang, Dongdai Lin 

Publication date: 22 March 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2011.09.001

Recommendations

• A method for counting the number of polynomial equivalence classes
• On enumeration of polynomial equivalence classes
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Progress in Cryptology - INDOCRYPT 2003
• scientific article; zbMATH DE number 1303122

zbMATH Keywords

finite geometryequivalence classesmultivariate public key cryptographypolynomial isomorphismsuperfluous keys

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic theory of polynomial rings over finite fields (11T55) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2003
• Advances in Cryptology - CRYPTO 2003
• Multivariate public key cryptosystems
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Practical Cryptanalysis of SFLASH
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cryptanalysis of SFLASH with Slightly Modified Parameters
• Unbalanced Oil and Vinegar Signature Schemes
• Public Key Cryptography - PKC 2005
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Title not available (Why is that?)
• On the orthogonal invariants of a subspace of a vector space over a finite field of odd characteristic
• Anzahl theorems in finite singular symplectic, unitary and orthogonal geometries
• Further studies on singular symplectic unitary, and orthogonal geometries over finite fields
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Title not available (Why is that?)
• Key Recovery on Hidden Monomial Multivariate Schemes

Cited In (8)

• On self-equivalence encodings in white-box implementations
• Implicit white-box implementations: white-boxing ARX ciphers
• On enumeration of polynomial equivalence classes
• On tameness of Matsumoto-Imai central maps in three variables over the finite field \(\mathbb F_2\)
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• Linearized polynomials over finite fields revisited
• Connection between classification and minimum polynomial of multiplexed sequences
• A method for counting the number of polynomial equivalence classes

Uses Software

• FGb

This page was built for publication: On enumeration of polynomial equivalence classes and their application to MPKC

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