Further study on indecomposable cryptographic functions

Further study on indecomposable cryptographic functions

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...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of Computer Science Vol. 17; no. 2; p. 172803
Main Authors: WANG, Zhongqiu, XIA, Shixiong, ZHANG, Fengrong
Format: Journal Article
Language:English
Published: Beijing Higher Education Press 2023
Springer Nature B.V
Subjects:
Boolean algebra
Boolean functions
Computer Science
Cryptography
Decomposition
Letter
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:Document received on :2020-11-18
Document accepted on :2021-08-03
ISSN:2095-2228
2095-2236
DOI:10.1007/s11704-021-0550-2