A new post-quantum multivariate polynomial public key encapsulation algorithm
From MaRDI portal
Publication:2102772
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
Cites work
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- A polynomial-time algorithm for solving a class of underdetermined multivariate quadratic equations over fields of odd characteristics
- A toolkit for ring-LWE cryptography
- Advances in Cryptology - CRYPTO 2003
- All in the XL Family: Theory and Practice
- Classical hardness of learning with errors
- Cryptanalysis of Variants of UOV
- Differential Cryptanalysis for Multivariate Schemes
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Extended algorithm for solving underdefined multivariate quadratic equations
- Finding shortest lattice vectors faster using quantum search
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 1617932 (Why is no real title available?)
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1950612 (Why is no real title available?)
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Introduction to security reduction
- Lattice cryptography for the internet
- Learning with rounding, revisited. New reduction, properties and applications
- Multivariate Public Key Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- NTRU prime: reducing attack surface at low cost
- On lattices, learning with errors, random linear codes, and cryptography
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the inherent intractability of certain coding problems (Corresp.)
- On the Security of HFE, HFEv- and Quartz
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Pseudorandom functions and lattices
- Public Key Cryptography – PKC 2004
- Public Key Cryptography – PKC 2004
- Public-key cryptosystems from the worst-case shortest vector problem
- Simple matrix scheme for encryption
- Smaller decoding exponents: ball-collision decoding
- The nature of computation
- Unbalanced Oil and Vinegar Signature Schemes
Cited in
(4)- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation
- A classically efficient forgery of MPPK/DS signatures
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
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)
