Simple matrix scheme for encryption

Chengdong Tao, Adama Diene, Shaohua Tang, Jintai Ding

Research output: Chapter in Book/Report/Conference proceedingConference contribution

74 Citations (Scopus)


There are several attempts to build asymmetric pubic key encryption schemes based on multivariate polynomials of degree two over a finite field. However, most of them are insecure. The common defect in many of them comes from the fact that certain quadratic forms associated with their central maps have low rank, which makes them vulnerable to the MinRank attack. We propose a new simple and efficient multivariate pubic key encryption scheme based on matrix multiplication, which does not have such a low rank property. The new scheme will be called Simple Matrix Scheme or ABC in short. We also propose some parameters for practical and secure implementation.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - 5th International Workshop, PQCrypto 2013, Proceedings
Number of pages12
Publication statusPublished - 2013
Event5th International Workshop on Post-Quantum Cryptography, PQCrypto 2013 - Limoges, France
Duration: Jun 4 2013Jun 7 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7932 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Workshop on Post-Quantum Cryptography, PQCrypto 2013


  • MinRank Attack
  • Multivariate Public Key Cryptosystem
  • Simple Matrix Scheme

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Simple matrix scheme for encryption'. Together they form a unique fingerprint.

Cite this