Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption

DOI10.1007/978-3-030-44223-1_19zbMath1501.94052OpenAlexW3015436028MaRDI QIDQ5041229

Bagus Santoso

Publication date: 13 October 2022

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_19

zbMATH Keywords

public-key encryptionisomorphism of polynomialsmultivariate quadratic polynomials

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

Solving the problem of blockwise isomorphism of polynomials with circulant matrices ⋮ Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• Provable secure post-quantum signature scheme based on isomorphism of polynomials in quantum random oracle model
• A modular analysis of the Fujisaki-Okamoto transformation
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Equivalent keys in ℳultivariate uadratic public key systems
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
• New public-key cryptosystem based on the morphism of polynomials problem
• Birthday Paradox for Multi-collisions
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption