HFERP - A New Multivariate Encryption Scheme

被引:12
作者
Ikematsu, Yasuhiko [3 ]
Perlner, Ray [2 ]
Smith-Tone, Daniel [1 ,2 ]
Takagi, Tsuyoshi [3 ]
Vates, Jeremy [1 ]
机构
[1] Univ Louisville, Dept Math, Louisville, KY 40292 USA
[2] NIST, Gaithersburg, MD 20899 USA
[3] Kyushu Univ, Inst Math Ind, Fukuoka, Japan
来源
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2018 | 2018年 / 10786卷
关键词
Multivariate cryptography; HFE; Encryption MinRank; Q-rank; CRYPTANALYSIS; POLYNOMIALS; OIL;
D O I
10.1007/978-3-319-79063-3_19
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP. The scheme achieved a smaller blow-up factor between the plaintext space and ciphertext space than most recent multivariate encryption proposals, but proved to be too aggressive and was completely broken by Perlner et al. in 2017. The scheme suffered from the same MinRank weakness that has allowed effective attacks on several notable big field multivariate schemes: HFE, multi-HFE, HFE-, for example. We propose a related new encryption scheme retaining the desirable traits of SRP and patching its weaknesses. We call the scheme HFERP because it utilizes a similar construction as SRP with an HFE primitive replacing the Square polynomial. The effect of this substitution is to increase the Q-rank of the pubic key to such a degree that the MinRank attack is impossible. HFERP still retains the relatively small blow-up factor between the plaintext space and ciphertext space, and is thus a candidate for secure multivariate encryption without an essential doubling in size between plaintext and ciphertext.
引用
收藏
页码:396 / 416
页数:21
相关论文
共 32 条
[1]  
[Anonymous], 2010, INT S SYMBOLIC ALGEB
[2]  
Bardet M., 2005, Effective Methods in Algebraic Geometry-MEGA, V205, P1
[3]   FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J].
BERLEKAMP, ER .
MATHEMATICS OF COMPUTATION, 1970, 24 (111) :713-+
[4]   Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic [J].
Bettale, Luk ;
Faugere, Jean-Charles ;
Perret, Ludovic .
DESIGNS CODES AND CRYPTOGRAPHY, 2013, 69 (01) :1-52
[5]   The Magma algebra system .1. The user language [J].
Bosma, W ;
Cannon, J ;
Playoust, C .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265
[6]   Key Recovery Attack for ZHFE [J].
Cabarcas, Daniel ;
Smith-Tone, Daniel ;
Verbel, Javier A. .
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2017, 2017, 10346 :289-308
[7]  
Clough C, 2009, LECT NOTES COMPUT SC, V5473, P252, DOI 10.1007/978-3-642-00862-7_17
[8]   The cubic simple matrix encryption scheme [J].
Ding, Jintai ;
Petzoldt, Albrecht ;
Wang, Lih-chung .
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8772 :76-87
[9]  
Ding JT, 2011, LECT NOTES COMPUT SC, V6841, P724, DOI 10.1007/978-3-642-22792-9_41
[10]  
Ding JT, 2005, LECT NOTES COMPUT SC, V3531, P164