TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Construction of S-boxes with LBN and DBN ≥ 4

* , ,

* Corresponding author · click or hover a name for details

pp. 1665–1682Vol. 26Issue 6September 2023DOI: 10.47974/JDMSC-1572 Crossmark XML
Received:
06 Oct 2021
Accepted:
10 Mar 2022
Published Online:
11 Sep 2023
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1572
Pages:
1665–1682

Abstract

There is always a need for good and safe S-boxes in block ciphers for secure communication. To improve the security of lightweight block ciphers, S-boxes with high linear and diiferential branch numbers (LBN and DBN) are utilized. Many of these S-boxes have been built in recent years. Sarkar et. al. built S-boxes with LBN and DBN both equal to 3. Kim Hangi et. al. also created 8-bit S-boxes using smaller S-boxes with at least 3 LBN and DBN. In this direction, we narrow the search space of 8 × 8 S-boxes with LBN = DBN = 4. We used the Feistel and Lai-Massey structures to build these S-boxes. We present a detailed explanation of such 8 × 8 S-boxes.

Keywords

Substitution boxFeistel and Lai-massey structuresLinear branch numberDifferential branch number

Subject Classifications

94A60

Acknowledgements

2105102

References

[1] Albrecht, M. R., Driessen, B., Kavun, E. B., Leander, G., Paar, C., & YalÇın, T., Block ciphers–focus on the linear layer (feat. PRIDE). In Annual Cryptology Conference, pp. 57-76 (2014, August). Springer, Berlin, Heidelberg. 
[2] Barreto, P. S. L. M., & Rijmen, V., The Whirlpool hashing function. In First Open NESSIE Workshop-CiteSeer, Leuven, Belgium, Vol. 13, p. 14 (2000, November). 
[3] Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J., ... & Vikkelsoe, C., PRESENT: An ultra-lightweight block cipher. In International workshop on cryptographic hardware and embedded systems, pp. 450-466 (2007, September). Springer, Berlin, Heidelberg. 
[4] Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E. B., Knezevic, M., Knudsen, L. R., ... & Yalçın, T., PRINCE–a low-latency block cipher for pervasive computing applications. In International conference on the theory and application of cryptology and information security, pp. 208-225 (2012, December). Springer, Berlin, Heidelberg. 
[5] Canteaut, A., Duval, S., & Leurent, G., Construction of lightweight S-boxes using Feistel and MISTY structures. In International Conference on Selected Areas in Cryptography, pp. 373-393 (2015, August). Springer, Cham. 
[6] Cui, J., Huang, L., Zhong, H., Chang, C., & Yang, W., An improved AES S-box and its performance analysis. International Journal of Innovative Computing, Information and Control, 7(5), 2291-2302 (2011). 
[7] Cui, L., & Cao, Y., A new S-box structure named affine-power-affine. International Journal of Innovative Computing, Information and Control, 3(3), 751-759 (2007). 
[8] De Canniere, C., Dunkelman, O., & Knežević, M., KATAN and KTANTAN–a family of small and efficient hardware-oriented block ciphers. In International Workshop on Cryptographic Hardware and Embedded Systems, pp. 272-288 (2009, September). Springer, Berlin, Heidelberg. 
[9] Farwa, S., Shah, T., & Idrees, L., A highly nonlinear S-box based on a fractional linear transformation. SpringerPlus, 5(1), 1-12 (2016). 
[10] Grosso, V., Leurent, G., Standaert, F. X., & Varıcı, K., LS-designs: Bitslice encryption for efficient masked software implementations. In International Workshop on Fast Software Encryption, pp. 18-37 (2014, March). Springer, Berlin, Heidelberg. 
[11] Hussain, I., Shah, T., Gondal, M. A., Khan, M., & Khan, W. A., Construction of new S-box using a linear fractional transformation. World Appl. Sci. J, 14(12), 1779-1785 (2011). 
[12] Jingmei, L., Baodian, W., & Xinmei, W., One AES S-box to increase complexity and its cryptanalysis. Journal of Systems Engineering and Electronics, 18(2), 427-433 (2007). 
[13] Karaahmetoğlu, O., Sakallı, M. T., Buluş, E., & Tutanescu, I., A new method to determine algebraic expression of power mapping based S-boxes. Information Processing Letters, 113(7), 229-235 (2013). 
[14] Kim, H., Jeon, Y., Kim, G., Kim, J., Sim, B. Y., Han, D. G., ... & Hong, D., A new method for designing lightweight S-boxes with high differential and linear branch numbers, and its application. IEEE Access, 9, 150592-150607 (2021). 
[15] Lim, C. H., CRYPTON: A New 128-bit Block Cipher-Specification and Analysis. NIST AES Proposal-CiteSeer (1998). 
[16] Lim, C. H., A revised version of CRYPTON: CRYPTON V1. 0. In International Workshop on Fast Software Encryption (pp. 31-45). Springer, Berlin, Heidelberg (1999, March). 
[17] Mamadolimov, A., Isa, H., & Mohamad, M. S., Practical bijective S-box design (2013). arXiv preprint arXiv:1301.4723. 
[18] Mroczkowski, P., Generating Pseudorandom S-Boxes-a Method of Improving the Security of Cryptosystems Based on Block Ciphers. Journal of Telecommunications and Information Technology, 74-79 (2009). 
[19] Mohamed, K., Pauzi, M. N. M., Ali, F. H. H. M., Ariffin, S., & Zulkipli, N. H. N., Study of S-box properties in block cipher. In 2014 International Conference on Computer, Communications, and Control Technology (I4CT), pp. 362-366(2014, September). IEEE. 
[20] Qureshi, A., & Shah, T., S-box on subgroup of Galois field based on linear fractional transformation. Electronics Letters, 53(9), 604-606 (2017). 
[21] Sakallı, M. T., Aslan, B., Buluş, E., Mesut, A. Ş., BÜyÜksaraçoğlu, F., & Karaahmetoğlu, O., On the algebraic expression of the AES S-box like S-boxes. In International Conference on Networked Digital Technologies, pp. 213-227 (2010, July). Springer, Berlin, Heidelberg. 
[22] Sarkar, S., Mandal, K., & Saha, D., On the relationship between resilient Boolean functions and linear branch number of S-boxes. In Progress in Cryptology–INDOCRYPT 2019: 20th International Conference on Cryptology in India, Hyderabad, India, December 15–18, 2019, Proceedings, pp. 361-374 (2019, November). Cham: Springer International Publishing. 
[23] Shannon, C. E., Communication theory of secrecy systems. The Bell System Technical journal, 28(4), 656-715 (1949). 
[24] Tran, M. T., Bui, D. K., & Duong, A. D., Gray S-box for advanced encryption standard. In 2008 International Conference on Computational Intelligence and Security, Vol. 1, pp. 253-258 (2008, December). IEEE. 
[25] Wheeler, D. J., & Needham, R. M., TEA, a tiny encryption algorithm. In International workshop on fast software encryption, pp. 363-366 (1994, December). Springer, Berlin, Heidelberg. 
[26] Zahid, A., & Arshad, M., An Innovative Design of Substitution-Boxes Using Cubic Polynomial Mapping. Symmetry, 11(3), 437 (2019). doi:10.3390/sym11030437. 

Views: 497Downloads: 99Citations: 0