首页> 外文期刊>Information Theory, IEEE Transactions on >Finding Biaffine and Quadratic Equations for S-Boxes Based on Power Mappings
【24h】

Finding Biaffine and Quadratic Equations for S-Boxes Based on Power Mappings

机译:基于功率映射查找S-Box的Biaffine和二次方程

获取原文
获取原文并翻译 | 示例
           

摘要

S-boxes having large number of linearly independent multivariate biaffine or quadratic equations may be susceptible to certain kinds of algebraic attacks. In a 2009 IEEE-IT paper, Nawaz provided a polynomial time algorithm to compute the number of such equations for finding S-boxes based on power mapping. Finding actual equations in polynomial time was still open. In this paper, techniques for finding a maximal set of linearly independent biaffine and quadratic equations are developed for S-boxes based on power mappings. Two algorithms to calculate the biaffine and quadratic equations for any S-box based on power mapping are presented. The time complexity of both the algorithms is .
机译:具有大量线性独立多元biaffine或二次方程的S-box可能易受某些代数攻击。在2009年IEEE-IT论文中,Nawaz提供了多项式时间算法来计算用于根据功率映射找到S盒的此类方程式的数量。在多项式时间内寻找实际方程仍然是开放的。在本文中,基于功率映射,为S盒开发了用于找到最大线性独立的仿射和二次方程组的技术。提出了两种基于功率映射来计算任何S盒的仿射方程和二次方程的算法。两种算法的时间复杂度均为。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号