两类新的(几乎)完美c-非线性排列
IF 0.6
4区 计算机科学
Q4 COMPUTER SCIENCE, THEORY & METHODS
International Journal of Foundations of Computer Science
Pub Date : 2023-09-27
DOI:10.1142/s0129054123500211
引用次数: 0
摘要
在这篇短文中，我们提出了两类(几乎)完美的[公式:见正文]——偶特征有限域上的非线性置换。本文章由计算机程序翻译，如有差异，请以英文原文为准。
Two New Classes of (Almost) Perfect c-Nonlinear Permutations
In this short note, we present two classes of (almost) perfect [Formula: see text]-nonlinear permutations over finite fields of even characteristic.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。
去求助
来源期刊
International Journal of Foundations of Computer Science
工程技术-计算机：理论方法
CiteScore
1.60
自引率
12.50%
发文量
63
审稿时长
3 months
期刊介绍：
The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include:
- Algebraic theory of computing and formal systems
- Algorithm and system implementation issues
- Approximation, probabilistic, and randomized algorithms
- Automata and formal languages
- Automated deduction
- Combinatorics and graph theory
- Complexity theory
- Computational biology and bioinformatics
- Cryptography
- Database theory
- Data structures
- Design and analysis of algorithms
- DNA computing
- Foundations of computer security
- Foundations of high-performance computing
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
