The cubic simple matrix encryption scheme

Jintai Ding*, Albrecht Petzoldt, Lih chung Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)

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 languageEnglish
Pages (from-to)76-87
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8772
DOIs
Publication statusPublished - 2014
Externally publishedYes

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