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

DOI10.1007/978-3-030-88323-2_12zbMath1492.94124OpenAlexW3206093499MaRDI QIDQ2151302

Takanori Yasuda, Yasuhiko Ikematsu, Bagus Santoso, Shuhei Nakamura

Publication date: 1 July 2022

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

zbMATH Keywords

public-key cryptographypost-quantum cryptographymultivariate public key cryptographyisomorphism of polynomials

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Provable secure post-quantum signature scheme based on isomorphism of polynomials in quantum random oracle model
• A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Multivariate Public Key Cryptosystems
• 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
• Birthday Paradox for Multi-collisions

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