Abstract
In this paper, we propose an improved version of the Simple Matrix encryption scheme of PQCrypto2013. The main goal of our construction is to build a system with even stronger security claims. By using square matrices with random quadratic polynomials, we can claim that breaking the system using algebraic attacks is at least as hard as solving a set of random quadratic equations. Furthermore, due to the use of random polynomials in the matrix A, Rank attacks against our scheme are not feasible.
| Original language | English |
|---|---|
| Pages (from-to) | 76-87 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 8772 |
| DOIs | |
| Publication status | Published - 2014 |
| Externally published | Yes |
Keywords
- Multivariate Cryptography
- Provable Security
- Simple Matrix Encryption Scheme
Fingerprint
Dive into the research topics of 'The cubic simple matrix encryption scheme'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver