arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2208.01442cs.CRcs.ITcs.SCmath.IT
收藏

求解超定MinRank实例的代数攻击的改进

Improvement of algebraic attacks for solving superdetermined MinRank instances

Magali Bardet, Manon Bertin

摘要:

MinRank(MR)问题是在许多加密应用中出现的计算问题。在Verbel等人(PQCrypto 2019)中,作者介绍了一种新的方法来解决MinRank问题的超定实例,从双线性Kipnis-Shamir(KS)建模开始。他们在特定的麦考利矩阵上使用线性代数,只考虑初始方程的一个变量块的倍数,所谓的“内核”变量。后来,Bardet等人(Asiacrypt 2020)引入了一种新的Support Minors建模(SM),该模型考虑了与内核变量相关联的Pl{ü}cker坐标,即KS建模中内核矩阵的最大次项。在本文中,我们给出了一个完整的代数解释之间的联系(KS)和(SM)建模(任何情况下)。然后,我们表明,超定MinRank实例可以被看作是简单的SM建模的实例。特别是,我们表明,在尽可能小的程度(“第一度下降”)和尽可能少的变量数进行计算并不总是最好的策略。我们给出了一般随机实例攻击的复杂性估计,并将这些结果应用于DAGS密码系统,该系统已提交给NIST标准化进程的第一轮。我们证明了Barelli和Couvreur(Asiacrypt 2018)的代数攻击,Bardet等人(CBC 2019)的改进,是一个特殊的超定MinRank实例。在这里,实例不是通用的,但我们表明可以分析DAGS中的特定实例,并提供一种方法来选择最佳参数(缩短位置的数量)来解决特定实例。

英文摘要:

The MinRank (MR) problem is a computational problem that arises in many cryptographic applications. In Verbel et al. (PQCrypto 2019), the authors introduced a new way to solve superdetermined instances of the MinRank problem, starting from the bilinear Kipnis-Shamir (KS) modeling. They use linear algebra on specific Macaulay matrices, considering only multiples of the initial equations by one block of variables, the so called ''kernel'' variables. Later, Bardet et al. (Asiacrypt 2020) introduced a new Support Minors modeling (SM), that consider the Pl{ü}cker coordinates associated to the kernel variables, i.e. the maximal minors of the Kernel matrix in the KS modeling. In this paper, we give a complete algebraic explanation of the link between the (KS) and (SM) modelings (for any instance). We then show that superdetermined MinRank instances can be seen as easy instances of the SM modeling. In particular, we show that performing computation at the smallest possible degree (the ''first degree fall'') and the smallest possible number of variables is not always the best strategy. We give complexity estimates of the attack for generic random instances.We apply those results to the DAGS cryptosystem, that was submitted to the first round of the NIST standardization process. We show that the algebraic attack from Barelli and Couvreur (Asiacrypt 2018), improved in Bardet et al. (CBC 2019), is a particular superdetermined MinRank instance.Here, the instances are not generic, but we show that it is possible to analyse the particular instances from DAGS and provide a way toselect the optimal parameters (number of shortened positions) to solve a particular instance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑