<p>In (Finite Fields Their Appl. <b>46</b>, 38–56 <CitationRef CitationID="CR32">2017</CitationRef>), Wu et al. defined the notion of quasi-multiplicative (QM) equivalence among permutation polynomials. Other than showing thoroughly, there is no efficient approach to determine whether two given permutation polynomials are QM equivalent or not. This paper provides new results to determine QM equivalence among permutation polynomials. Based on these, we explicitly provide a list of known permutation polynomials which are equivalent. It is worth noting that a lot of well-known permutation polynomials are QM equivalent, and thus we have only a handful of permutation polynomials which are novel.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A note on QM equivalence of known permutation polynomials

  • Akshay Ankush Yadav,
  • Harshdeep Singh,
  • Indivar Gupta

摘要

In (Finite Fields Their Appl. 46, 38–56 2017), Wu et al. defined the notion of quasi-multiplicative (QM) equivalence among permutation polynomials. Other than showing thoroughly, there is no efficient approach to determine whether two given permutation polynomials are QM equivalent or not. This paper provides new results to determine QM equivalence among permutation polynomials. Based on these, we explicitly provide a list of known permutation polynomials which are equivalent. It is worth noting that a lot of well-known permutation polynomials are QM equivalent, and thus we have only a handful of permutation polynomials which are novel.