Further study on indecomposable cryptographic functions

Zhongqiu Wang,Shixiong Xia,Fengrong Zhang

Frontiers of Computer Science（2022）

Cited 1|Views9

No score

Abstract

Conclusion The question related to (in)decomposition of functions has been addressed. We first corrected some results in [7]. Further, A generalized method to check decomposition of Boolean functions was provided. At last, some sufficient conditions that the functions constructed by the indirect sum construction were indecomposable were presented.

Translated text

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined