On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields
DOI10.1016/j.ffa.2016.01.002zbMath1339.94058OpenAlexW2237141153WikidataQ121177118 ScholiaQ121177118MaRDI QIDQ268465
Publication date: 15 April 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2016.01.002
NP-complete problemsNP-hard problemsalgebraic cryptanalysisasymmetric encryption schemesmultivariable encryption schemesmultivariable quadratic public-key cryptosystemspolynomial-time reductionssimultaneous algebraic Riccati equationsT-invariant subspaces
Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- On applications of Schauder's fixed-point theorem for the solution of the non-symmetric algebraic Riccati equation
- Generalized inverses of matrices with entries taken from an arbitrary field
- Numerical Solution of Algebraic Riccati Equations
- Post-Quantum Cryptography
- Multivariate Public Key Cryptography
- Overview of Cryptanalysis Techniques in Multivariate Public Key Cryptography
- Simple Matrix Scheme for Encryption
- Advanced Encryption Standard – AES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On multivariable encryption schemes based on simultaneous algebraic Riccati equations over finite fields