A new post-quantum multivariate polynomial public key encapsulation algorithm
DOI10.1007/S11128-022-03712-5OpenAlexW4307434441MaRDI QIDQ2102772FDOQ2102772
Authors: Randy Kuang, Maria Perepechaenko, Michel Barbeau 
Publication date: 9 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03712-5
Recommendations
- New public-key cryptosystem based on the morphism of polynomials problem
- Extended multivariate public key cryptosystems with secure encryption function
- Multivariate Public Key Cryptography
- Public-key cryptography from new multivariate quadratic assumptions
- A public-key encryption scheme based on non-linear indeterminate equations
public-key cryptographymultivariate polynomialskey encapsulation mechanism (KEM)multivariate polynomial public key (MPPK)post-quantum cryptography (PQC)PQC performance
Cites Work
- Title not available (Why is that?)
- Public-key cryptosystems from the worst-case shortest vector problem
- Smaller decoding exponents: ball-collision decoding
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Multivariate Public Key Cryptography
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- Simple matrix scheme for encryption
- Classical hardness of learning with errors
- Public Key Cryptography – PKC 2004
- Advances in Cryptology - CRYPTO 2003
- On lattices, learning with errors, random linear codes, and cryptography
- The nature of computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Title not available (Why is that?)
- Unbalanced Oil and Vinegar Signature Schemes
- Pseudorandom functions and lattices
- New directions in nearest neighbor searching with applications to lattice sieving
- Title not available (Why is that?)
- A toolkit for ring-LWE cryptography
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Lattice cryptography for the internet
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- All in the XL Family: Theory and Practice
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Finding shortest lattice vectors faster using quantum search
- Extended algorithm for solving underdefined multivariate quadratic equations
- Learning with rounding, revisited. New reduction, properties and applications
- NTRU prime: reducing attack surface at low cost
- Differential Cryptanalysis for Multivariate Schemes
- On the Security of HFE, HFEv- and Quartz
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Public Key Cryptography – PKC 2004
- A polynomial-time algorithm for solving a class of underdetermined multivariate quadratic equations over fields of odd characteristics
- Introduction to security reduction
- Cryptanalysis of Variants of UOV
Cited In (4)
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- A classically efficient forgery of MPPK/DS signatures
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation
Uses Software
This page was built for publication: A new post-quantum multivariate polynomial public key encapsulation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102772)
