An Algorithm for Constructing Support of Bent Functions by Extending a Set
Boolean functions form the fundamental components of symmetric cryptographic systems, serving as the building blocks. Modifying bent functions makes it feasible to design Boolean functions with desired properties that exhibit high non-linearity. The current study offers a comprehensive analysis of b...
Main Authors: | Joseph Nelson, Chungath Srinivasan, K. V. Lakshmy |
---|---|
Format: | Article |
Language: | English |
Published: |
Ram Arti Publishers
2023-10-01
|
Series: | International Journal of Mathematical, Engineering and Management Sciences |
Subjects: | |
Online Access: | https://www.ijmems.in/cms/storage/app/public/uploads/volumes/60-IJMEMS-23-0166-8-5-1040-1055-2023.pdf |
Similar Items
-
A New Algorithm for Enumerating Bent Functions Based on Truth Tables and Run Length
by: Yongbin Zhao, et al.
Published: (2018-01-01) -
REGULAR METHOD FOR SYNTHESIS OF BASIC BENT-SQUARES OF RANDOM ORDER
by: A. V. Sokolov
Published: (2016-08-01) -
Construction of an S-Box Based on Chaotic and Bent Functions
by: Zijing Jiang, et al.
Published: (2021-04-01) -
BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor
by: M. Todorova, et al.
Published: (2019-06-01) -
Construction and Assignment of Orthogonal Sequences and Zero Correlation Zone Sequences Over GF(<italic>p</italic>)
by: Chunlei Xie, et al.
Published: (2022-01-01)