Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation

DOI10.1007/s11128-023-04064-4OpenAlexW4385986289WikidataQ122999697 ScholiaQ122999697MaRDI QIDQ6073976

Randy Kuang, Maria Perepechaenko

Publication date: 18 September 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-023-04064-4

zbMATH Keywords

multivariate polynomialspublic key cryptographypost-quantum cryptographykey encapsulation mechanismKEMPQCPQC performanceDiophantine equation problemhidden ring

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the deterministic complexity of factoring polynomials over finite fields
• A new post-quantum multivariate polynomial public key encapsulation algorithm
• Quantum permutation pad for universal quantum-safe cryptography
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Rainbow, a New Multivariable Polynomial Signature Scheme
• Multivariate Public Key Cryptography
• Communication Theory of Secrecy Systems*
• Unbalanced Oil and Vinegar Signature Schemes
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Character sums and deterministic polynomial root finding in finite fields
• Public Key Cryptography - PKC 2005
• Topics in Cryptology – CT-RSA 2006
• Public Key Cryptography – PKC 2004
• Breaking rainbow takes a weekend on a laptop

This page was built for publication: Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation