{"title":"New classes of permutation trinomials of F22m","authors":"Akshay Ankush Yadav , Indivar Gupta , Harshdeep Singh , Arvind Yadav","doi":"10.1016/j.ffa.2024.102414","DOIUrl":null,"url":null,"abstract":"<div><p>In recent years, there have been a lot of research towards finding conditions under which the trinomial <span><math><msup><mrow><mi>x</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>α</mi><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></msup><mo>+</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>β</mi><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></msup><mo>+</mo><mn>1</mn><mo>)</mo></math></span> permutes <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>m</mi></mrow></msup></mrow></msub></math></span> with <span><math><mi>α</mi><mo>></mo><mi>β</mi></math></span> and <em>r</em> being positive integers. The authors of <span>[6]</span>, <span>[10]</span>, <span>[24]</span> have determined these conditions when <span><math><mi>α</mi><mo>≤</mo><mn>5</mn></math></span> for certain values of <em>β</em> and <em>r</em>. In this paper, we work for <span><math><mi>α</mi><mo>=</mo><mn>6</mn></math></span> and determine four new classes of such permutation trinomials. Our contribution encompasses the investigation of these unexplored classes. Additionally, we analyze their quasi-multiplicative equivalence with already known permutation trinomials for <span><math><mi>m</mi><mo>≥</mo><mn>1</mn></math></span>. Through our research, we demonstrate that two of these determined classes are new, and for others, we explicitly compute the exponent for which they become equivalent.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"96 ","pages":"Article 102414"},"PeriodicalIF":1.2000,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579724000534","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In recent years, there have been a lot of research towards finding conditions under which the trinomial permutes with and r being positive integers. The authors of [6], [10], [24] have determined these conditions when for certain values of β and r. In this paper, we work for and determine four new classes of such permutation trinomials. Our contribution encompasses the investigation of these unexplored classes. Additionally, we analyze their quasi-multiplicative equivalence with already known permutation trinomials for . Through our research, we demonstrate that two of these determined classes are new, and for others, we explicitly compute the exponent for which they become equivalent.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.