Staff View: S-box construction from non-permutation power functions

S-box construction from non-permutation power functions

A substitution box (s-box) is a nonlinear component function used in most block ciphers. It must fulfill several cryptographic properties such as high nonlinearity, low differential uniformity and complex algebraic expression to resist against linear, differential and interpolation attacks. In this...

Full description

Saved in:

Bibliographic Details
Main Authors:	Isa H., Jamil N., Z'aba M.R.
Other Authors:	56432795500
Format:	Conference paper
Published:	2023
Subjects:	Bijective s-box Non-permutation power functions Redundancy removal algorithm S-box performance Substitution box Complex networks Cryptography Frequency hopping Lyapunov methods Security of data Power functions Redundancy removal Substitution boxes Finite element method
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uniten.dspace-29381
record_format	dspace
spelling	my.uniten.dspace-293812023-12-28T12:12:49Z S-box construction from non-permutation power functions Isa H. Jamil N. Z'aba M.R. 56432795500 36682671900 24726154700 Bijective s-box Non-permutation power functions Redundancy removal algorithm S-box performance Substitution box Complex networks Cryptography Frequency hopping Lyapunov methods Security of data Bijective s-box Power functions Redundancy removal S-box performance Substitution boxes Finite element method A substitution box (s-box) is a nonlinear component function used in most block ciphers. It must fulfill several cryptographic properties such as high nonlinearity, low differential uniformity and complex algebraic expression to resist against linear, differential and interpolation attacks. In this paper, we extend and improve the s-box construction method proposed by Mamadolimov et al. [26, 27] which construct an s-box from power and binomial functions over the finite field F28. We study the cryptographic properties exhibited from our s-box and do a comparative analysis with several known 8�8 bijective s-boxes. Our analysis shows that our proposed s-box is ranked seventh compared to known 8�8 bijective s-boxes in terms of strong cryptographic properties. It even surpasses some known s-boxes used in popular block ciphers. Copyright � 2013 ACM. Final 2023-12-28T04:12:49Z 2023-12-28T04:12:49Z 2013 Conference paper 10.1145/2523514.2523525 2-s2.0-84893310923 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893310923&doi=10.1145%2f2523514.2523525&partnerID=40&md5=b4de2546dd9edf3f506128464b839d29 https://irepository.uniten.edu.my/handle/123456789/29381 46 53 Scopus
institution	Universiti Tenaga Nasional
building	UNITEN Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Tenaga Nasional
content_source	UNITEN Institutional Repository
url_provider	http://dspace.uniten.edu.my/
topic	Bijective s-box Non-permutation power functions Redundancy removal algorithm S-box performance Substitution box Complex networks Cryptography Frequency hopping Lyapunov methods Security of data Bijective s-box Power functions Redundancy removal S-box performance Substitution boxes Finite element method
spellingShingle	Bijective s-box Non-permutation power functions Redundancy removal algorithm S-box performance Substitution box Complex networks Cryptography Frequency hopping Lyapunov methods Security of data Bijective s-box Power functions Redundancy removal S-box performance Substitution boxes Finite element method Isa H. Jamil N. Z'aba M.R. S-box construction from non-permutation power functions
description	A substitution box (s-box) is a nonlinear component function used in most block ciphers. It must fulfill several cryptographic properties such as high nonlinearity, low differential uniformity and complex algebraic expression to resist against linear, differential and interpolation attacks. In this paper, we extend and improve the s-box construction method proposed by Mamadolimov et al. [26, 27] which construct an s-box from power and binomial functions over the finite field F28. We study the cryptographic properties exhibited from our s-box and do a comparative analysis with several known 8�8 bijective s-boxes. Our analysis shows that our proposed s-box is ranked seventh compared to known 8�8 bijective s-boxes in terms of strong cryptographic properties. It even surpasses some known s-boxes used in popular block ciphers. Copyright � 2013 ACM.
author2	56432795500
author_facet	56432795500 Isa H. Jamil N. Z'aba M.R.
format	Conference paper
author	Isa H. Jamil N. Z'aba M.R.
author_sort	Isa H.
title	S-box construction from non-permutation power functions
title_short	S-box construction from non-permutation power functions
title_full	S-box construction from non-permutation power functions
title_fullStr	S-box construction from non-permutation power functions
title_full_unstemmed	S-box construction from non-permutation power functions
title_sort	s-box construction from non-permutation power functions
publishDate	2023
_version_	1806426430092869632
score	13.222552

S-box construction from non-permutation power functions

Similar Items