Poly-dragon: an efficient multivariate public key cryptosystem
From MaRDI portal
Recommendations
- A public key cryptosystem using a group of permutation polynomials
- On multivariate public keys based on a pair of transformations with density gap
- Multivariate Public Key Cryptography
- Efficient public-key operation in multivariate schemes
- Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- Asymmetric Cryptography with a Hidden Monomial
- Differential Cryptanalysis for Multivariate Schemes
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical Cryptanalysis of SFLASH
- Public-key cryptography using paraunitary matrices
Cited in
(13)- A public key cryptosystem using a group of permutation polynomials
- Efficient public-key operation in multivariate schemes
- Probabilistic multivariate cryptography
- Public-key identification schemes based on multivariate cubic polynomials
- Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems
- Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\)
- On multivariate public keys based on a pair of transformations with density gap
- A method for generating permutation polynomials modulo p^n
- Lattice-based public key cryptosystems invoking linear mapping mask
- Some results on complete permutation polynomials and mutually orthogonal Latin squares
- DME: A Full Encryption, Signature and KEM Multivariate Public Key Cryptosystem
- Some quadratic permutation polynomials over finite fields
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
This page was built for publication: Poly-dragon: an efficient multivariate public key cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999551)
