Solving the problem of blockwise isomorphism of polynomials with circulant matrices

DOI10.1007/978-3-030-85987-9_8zbMATH Open1497.94099OpenAlexW3196854063MaRDI QIDQ2128752FDOQ2128752

Yasufumi Hashimoto

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_8

zbMATH Keywords

circulant matrixisomorphism of polynomialsblockwise isomorphism of polynomials

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• New public-key cryptosystem based on the morphism of polynomials problem

Cited In (2)

• An application of the Gröbner basis in computation for the minimal polynomials and inverses of block circulant matrices
• Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group

Uses Software

• GeMSS

This page was built for publication: Solving the problem of blockwise isomorphism of polynomials with circulant matrices

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