A new central map for multivariate encryption scheme
From MaRDI portal
Publication:6665873
Publication date: 17 January 2025
Published in: Gaṇita (Search for Journal in Brave)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Multivariate public key cryptosystems
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- The Cubic Simple Matrix Encryption Scheme
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A new central map for multivariate encryption scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665873)