Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials

DOI10.1007/978-3-030-88323-2_12MaRDI QIDQ2151302zbMATH OpenOpenAlexFDO

Authors Yasuhiko Ikematsu, Shuhei Nakamura, Bagus Santoso, Takanori Yasuda

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88323-2_12

zbMATH Keywords

isomorphism of polynomialsmultivariate public key cryptographypost-quantum cryptographypublic-key cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Solving the problem of blockwise isomorphism of polynomials with circulant matrices
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

Cites work

• A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
• Birthday Paradox for Multi-collisions
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 1303122 (Why is no real title available?)
• Multivariate public key cryptosystems
• New public-key cryptosystem based on the morphism of polynomials problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Provable secure post-quantum signature scheme based on isomorphism of polynomials in quantum random oracle model

Cited in

(3)

• Solving the problem of blockwise isomorphism of polynomials with circulant matrices
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• An efficient ElGamal cryptosystem based on prime power moduli and modular key exchange

This page was built for publication: Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials

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