Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Abughazalah, Nabilaha | Khan, Majidb; * | Batool, Syeda Iramc
Affiliations: [a] Department of Mathematical Sciences, College of Science, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia | [b] Department of Applied Mathematics & Statistics, Institute of Space Technology, Islamabad, Pakistan | [c] Department of Mathematics, Quaid-i-Azam University, Islamabad, Pakistan
Correspondence: [*] Corresponding author. Majid Khan, Department of Applied Mathematics & Statistics, Institute of Space Technology, Islamabad, Pakistan. E-mail: mk.cfd1@gmail.com.
Abstract: Designing of nonlinear confusion component of block cipher is one of the most important and inevitable research problem. Nowadays mostly heuristic search schemes were utilized for the construction of these confusion component. To construct, a cryptographically secure confusion component several algebraic structures were utilized. The thirst for new algebraic structure for the construction of these nonlinear confusion component has always been a point of interest. In this communication, we have utilized a maximal cyclic subgroup of unit of Galois ring. The offered algorithm is more general as compared to Galois field. The class of Boolean functions over Galois ring fall in mixed category which are not completely balanced. Boolean functions having higher nonlinearity and others cryptographic aspects added an inevitable significance in the construction of modern block ciphers. The primary idea of this article is to structure non-balanced Boolean functions on n variables, where n is an even integer, sustaining strict avalanche criterion (SAC) and bit independent criterion (BIC). By comparing SAC with available cryptographic Boolean functions, the constructed multivalued Boolean function acquire highest nonlinearity which does not follow the existing nonlinearity bound of Boolean functions. These newly proposed S-boxes consists of n basic Boolean functions which satisfy the balancedness and non-balancedness criterion. Therefore, these S-box structure lies within a less balanced and more bent Boolean function categories.
Keywords: S-box, Galois Ring, maximal cyclic subgroup
DOI: 10.3233/JIFS-213591
Journal: Journal of Intelligent & Fuzzy Systems, vol. 43, no. 3, pp. 3051-3065, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl