有限域上置换多项式的组成逆的考察

IF 1.2 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-06-27 DOI:10.1007/s10623-024-01436-4

Qiang Wang

{"title":"有限域上置换多项式的组成逆的考察","authors":"Qiang Wang","doi":"10.1007/s10623-024-01436-4","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we survey on the recent results and methods in the study of compositional inverses of permutation polynomials over finite fields. In particular, we describe a framework in terms of a commutative diagram which unifies several recent methods in finding the inverses of permutation polynomials.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"20 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A survey of compositional inverses of permutation polynomials over finite fields\",\"authors\":\"Qiang Wang\",\"doi\":\"10.1007/s10623-024-01436-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we survey on the recent results and methods in the study of compositional inverses of permutation polynomials over finite fields. In particular, we describe a framework in terms of a commutative diagram which unifies several recent methods in finding the inverses of permutation polynomials.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01436-4\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01436-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

本文概述了研究有限域上置换多项式的组成逆的最新成果和方法。特别是，我们描述了一个交换图框架，它统一了最近几种寻找置换多项式倒数的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A survey of compositional inverses of permutation polynomials over finite fields

In this paper, we survey on the recent results and methods in the study of compositional inverses of permutation polynomials over finite fields. In particular, we describe a framework in terms of a commutative diagram which unifies several recent methods in finding the inverses of permutation polynomials.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.

期刊最新文献

Cliques in Paley graphs of square order and in Peisert graphs On anti-collusion codes for averaging attack in multimedia fingerprinting LRCS: Duality, LP bounds, and field size Weights of a class of projective geometry codes Codes over an infinite family of local rings of order $$2^{5^k}$$ with two Gray maps