Simple Matrix encryption scheme with variable ciphertext length

Zhong WANG; Yiliang HAN

doi:10.11959/j.issn.2096-109x.2018032

您当前的位置：

首页 >

文章列表页 >

Simple Matrix encryption scheme with variable ciphertext length

Papers | 更新时间：2024-06-03

- Simple Matrix encryption scheme with variable ciphertext length
- Chinese Journal of Network and Information Security Vol. 4, Issue 4, Pages: 56-62(2018)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.2096-109x.2018032
  CLC： TN918.4
- Online First：2018-04，
  
  Published：15 April 2018
- 稿件说明：
移动端阅览
Zhong WANG, Yiliang HAN. Simple Matrix encryption scheme with variable ciphertext length[J]. Chinese Journal of Network and Information Security, 2018, 4(4): 56-62.
DOI：

Zhong WANG, Yiliang HAN. Simple Matrix encryption scheme with variable ciphertext length[J]. Chinese Journal of Network and Information Security, 2018, 4(4): 56-62. DOI： 10.11959/j.issn.2096-109x.2018032.

摘要

多变量公钥密码是抗量子密码的可靠候选之一，其中的Simple Matrix方案是利用3个矩阵间的运算来构造的。提出了Simple Matrix方案的改进版本，通过使用具有随机二次多项式的可改变形式的扁平矩阵进行构造，使秩攻击对新的方案不可行，且代数攻击对新方案的攻击至少和求解一组随机二次方程一样困难。新的方案将密文与明文的比例改进为大于等于两倍，打破了固定不变的密文与明文比例，使其拥有一个灵活的明密文比，以适应不同的需求。

Abstract

Multivariable public key cryptography is one of the reliable candidates for anti-quantum cryptography.The Simple Matrix scheme is constructed using the operations between three matrices.An improved version of the Simple Matrix scheme was proposed.It is constructed by using two flat matrices with random quadratic polynomials

so that the rank attacks is infeasible for the new scheme

and the algebraic attacks breaks the system is at least as hard as solving a set of random quadratic equations.The new scheme will improve the proportion of ciphertext and plaintext to 2 times or more

break the fixed proportion of ciphertext and plaintext

so that it has a flexible proportion to adapt to different needs.

关键词

Keywords

references

RIVEST R L , SHAMIR A , ADLEMAN L . A method for obtaining digital signatures and public-key cryptosystems [J ] . Communications of the ACM , 21 ( 2 ): 120 - 126 : 1978

SHOR P W , . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [C ] // Quantum Entanglement and Quantum Information-Proceedings of CCAST . 1999 : 303 - 332 .

BERNSTEIN D J , BUCHMANN J , DAHMEN E . Post quantum cryptography [M ] . Berlin Heidelberg : Springer , 2010 .

BOGDANOV A , EISENBARTH T , RUPP A , et al . Time-area optimized publickey engines:MQ-cryptosystems as replacement for elliptic curves? [C ] // Cryptographic Hardware and Embedded Systems–CHES 2008 . 2008 : 45 - 61 .

DING J , SCHMIDT D . Rainbow,a new multivariable polynomial signature scheme [C ] // International Conference on Applied Cryptography and Network Security . 2005 : 164 - 175 .

CHENG T , DIENE A , TANG S , et al . Simple matrix scheme for encryption [C ] // International Workshop on Post-Quantum Cryptography . 2013 : 231 - 242 .

DING J , PETZOLDT A , WANG L C . The cubic simple matrix encryption scheme [C ] // Post-Quantum Cryptography . 2014 : 76 - 87 .

KIPNIS A , SHAMIR A . Cryptanalysis of the HFE public key cryptosystem [C ] // Advances in Cryptology—CRYPTO’99 . 1999 : 19 - 30 .

SAKUMOTO K , SHIRAI T , HIWATARI H . Public-key identification schemes based on multivariate quadratic polynomials [J ] . Technical Report of Ieice Isec , 2011 , 111 : 706 - 723 .

PATARIN J , . Asymmetric cryptography with a hidden monomial [C ] // Advances in Cryptology—CRYPTO ’96 . 1996 : 45 - 60 .

DING J , GOWER J E , SCHMIDT D S . Multivariate public key cryptosystems [M ] . US : Springer US , 2006 .

丁斗博 . 多变量公钥密码中TTS方案的分析与改进 [D ] . 西安:西安电子科技大学 , 2013 .

DING D B . Analysis and improvement on the multivariate quadrat-ic TTS scheme [D ] . Xi’an:Xidian University , 2013 .

GOUBIN L , COURTOIS N . Cryptanalysis of the TTM Cryptosystem [C ] // International Conference on the Theory and Application of Cryptology and Information Security . 2000 : 44 - 57 .

COPPERSMITH D , STERN J , VAUDENAY S . Attacks on the birational permutation signature schemes [C ] // Advances in Cryptology—CRYPTO’ 93 . 1993 : 435 - 443 .

DING J , SCHMIDT D . Rainbow,a new multivariable polynomial signature scheme [C ] // Applied Cryptography and Network Security . 2005 : 164 - 175 .

COURTOIS N , KLIMOV A , PATARIN J , et al . Efficient algorithms for solving overdefined systems of multivariate polynomial equations [C ] // Advances in Cryptology—EUROCRYPT 2000 . 2000 : 392 - 407 .

FAUGERE J C , . A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) [C ] // The 2002 International Symposium on Symbolic and Algebraic Computation . 2002 : 75 - 83 .

FAUGERE J C . A new efficient algorithm for computing Grobner bases (F4) [J ] . Journal of Pure and Applied Algebra , 1999 , 139 : 61 - 88 .

DING J , BUCHMANN J . Solving degree and degree of regularity for polynomial systems over a finite fields [C ] // The First International Conference on Symbolic Computation and Cryptography (SCC 2008) . 2008 .

MOHAMED M S E , CABARCAS D , DING J , et al . MXL 3:an efficient algorithm for computing gröbner bases of zero- dimensional ideals [C ] // International Conference on Information Security and Cryptology . 2009 : 87 - 100 .

Views

1360

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

5G-based smart airport network security scheme design and security analysis

Survey of smart contract security

Formal specification and security verification of usage control model based on PAT

Related Author

Xinxin XING

Qingya ZUO

Jianwei LIU

Bo MENG

Jiabing LIU

Qin LIU

Xiaoxiao WANG

Xurui ZHENG

Related Institution

School of Cyber Science and Technology, Beihang University

International School, Beijing University of Posts and Telecommunications

⁰