A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields

IF 1.2 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences Pub Date : 2023-08-15 DOI:10.1007/s12095-023-00661-3

M. Steiner

引用次数: 0

查看原文本刊更多论文

有限域上乘性复杂度的微分均匀性的下界&乘性复杂度为1的双目标函数

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences COMPUTER SCIENCE, THEORY & METHODS-MATHEMATICS, APPLIED

CiteScore

2.50

自引率

7.10%

发文量

期刊介绍： The scope of the journal focuses on discrete structures used in stream and block ciphers in symmetric cryptography; code division multiple access in communications; and random number generation for statistics, cryptography and numerical methods. In particular, papers covering Boolean functions and sequences, without excluding any other discrete structure used in cryptography and communications, such as finite fields and other algebraic structures, are strongly encouraged.