TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

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
Open Access Research Article

Keyed S-boxes from sponge functions

* , , ,

* Corresponding author · click or hover a name for details

pp. 2241–2254Vol. 27Issue 8December 2024DOI: 10.47974/JDMSC-1724 Crossmark XML
Received:
10 Aug 2022
Accepted:
09 Nov 2022
Published Online:
18 Dec 2024
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1724
Pages:
2241–2254

Abstract

This paper examines the generation of key-dependent S-boxes using sponge functions. In this study, we render 8-bit key-dependent S-boxes employing a novel approach that contrasts previous techniques using a mixing strategy. We test the efficiency and security of the resultant S-boxes by performing a sequence of experiments. We consider the integration of the keyed S-boxes into a symmetric cipher and determine the probability of differential cryptanalysis. We found that the maximum differential distribution is approximately 12/256 or ≈ 2–6, with a mean of roughly 11/256 and a standard deviation of 1.2/256. Our review of other methods concludes that they have the same maximum differential distribution, while our generation method is significantly faster. We conclude by characterising future research on keyed S-boxes in a white-box context.

Keywords

Subject Classifications

94A6020C05

References

[1] M. Ahmad and A. Chopra, “Chaotic dynamic S-boxes based substitution approach for digital images,” arXiv preprint arXiv:1709.07620 (2017).
[2] A. S. Al-Wattar, R. Mahmod, Z. A. Zukarnain, and N. I. Udzir, “Generating a new S-box inspired by biological DNA,” International Journal of Computer Science and Application, vol. 4, no. 1, pp. 32–42, 2015.
[3] A. ALabaichi, R. Mahmod, and F. Ahmad, “Randomness analysis of 128 bits Blowfish block cipher on ECB mode,” International Journal of Computer Science and Information Security, vol. 11, no. 10, p. 8 (2013).
[4] M. Asim and V. Jeoti, “Efficient and simple method for designing chaotic S-boxes,” ETRI Journal, vol. 30, no. 1, pp. 170–172 (2008).
[5] A. Belazi and A. A. Abd El-Latif, “A simple yet efficient S-box method based on chaotic sine map,” Optik, vol. 130, pp. 1438–1444 (2017).
[6] G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Duplexing the sponge: single-pass authenticated encryption and other applications,” in International Workshop on Selected Areas in Cryptography, pp. 320–337, Springer (2011).
[7] E. Biham, A. Biryukov, and A. Shamir, “Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials,” Journal of Cryptology, vol. 18, no. 4, pp. 291–311 (2005).
[8] A. Bogdanov and T. Isobe, “White-box cryptography revisited: Space-hard ciphers,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1058–1069 (2015).
[9] J. Bringer, H. Chabanne, E. Dottax, et al., “White-box cryptography: Another attempt,” IACR Cryptology ePrint Archive, vol. 2006, p. 468 (2006).
[10] G. Chen, Y. Chen, and X. Liao, “An extended method for obtaining S-boxes based on three-dimensional chaotic baker maps,” Chaos, Solitons & Fractals, vol. 31, no. 3, pp. 571–579 (2007).
[11] L. Chen and R. Zhang, “A key-dependent cipher DSdp,” in 2008 International Symposium on Electronic Commerce and Security, pp. 310–313, IEEE (2008).
[12] S. Chow, P. Eisen, H. Johnson, and P. C. Van Oorschot, “White-box cryptography and an AES implementation,” in International Workshop on Selected Areas in Cryptography, pp. 250–270, Springer (2002).
[13] F. Cioschi, N. Fornari, and A. Visconti, “White-box cryptography: A time-security trade-off for the SPNbox family,” in International Conference on Wireless Intelligent and Distributed Environment for Communication, pp. 153–166, Springer (2018).
[14] J. Daemen and V. Rijmen, The Design of Rijndael, vol. 2, Springer (2002).
[15] C. Delerablée, T. Lepoint, P. Paillier, and M. Rivain, “White-box security notions for symmetric encryption schemes,” in International Conference on Selected Areas in Cryptography, pp. 247–264, Springer (2013).
[16] R. Durstenfeld, “Algorithm 235: random permutation,” Communications of the ACM, vol. 7, no. 7, p. 420 (1964).
[17] M. Eberl, “Fisher-Yates shuffle,” Arch. Formal Proofs (2016).
[18] H. Feistel, W. A. Notz, and J. L. Smith, “Some cryptographic techniques for machine-to-machine data communications,” Proceedings of the IEEE, vol. 63, no. 11, pp. 1545–1554 (1975).
[19] P. FIPS, “Data encryption standard—federal information processing standards publication 46,” U.S. Department of Commerce/National Bureau of Standards, National Technical Information Service (1977).
[20] D. H. Hamer, G. Sullivan, and F. Weierud, “Enigma variations: An extended family of machines,” in Proceedings-A, vol. 140, Citeseer (1993).
[21] R. Hosseinkhani and H. H. S. Javadi, “Using cipher key to generate dynamic S-box in AES cipher system,” International Journal of Computer Science and Security (IJCSS), vol. 6, no. 1, pp. 19–28 (2012).
[22] G. Jakimoski and L. Kocarev, “Chaos and cryptography: block encryption ciphers based on chaotic maps,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 48, no. 2, pp. 163–169 (2001).
[23] H. Liu, B. Zhao, and L. Huang, “Quantum image encryption scheme using Arnold transform and S-box scrambling,” Entropy, vol. 21, no. 4, p. 343 (2019).
[24] E. M. Mahmoud, A. Abd El Hafez, and T. A. El Hafez, “Dynamic AES-128 with key-dependent S-box,” (2013).
[25] M. Matsui, “New block encryption algorithm Misty,” in International Workshop on Fast Software Encryption, pp. 54–68, Springer (1997).
[26] R. C. Merkle, “Fast software encryption functions,” in Conference on the Theory and Application of Cryptography, pp. 477–501, Springer (1990).
[27] V. Rijmen and J. Daemen, “Advanced encryption standard,” Proceedings of Federal Information Processing Standards Publications, National Institute of Standards and Technology, pp. 19–22 (2001).
[28] R. L. Rivest and A. T. Sherman, “Randomized encryption techniques,” in Advances in Cryptology, pp. 145–163, Springer (1983).
[29] M. J. O. Saarinen, “Cryptographic analysis of all 4× 4-bit S-boxes,” in International Workshop on Selected Areas in Cryptography, pp. 118–133, Springer (2011).
[30] B. Schneier, “Description of a new variable-length key, 64-bit block cipher (Blowfish),” in International Workshop on Fast Software Encryption, pp. 191–204, Springer (1993).
[31] B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, The Twofish encryption algorithm: a 128-bit block cipher, John Wiley & Sons, Inc. (1999).
[32] M. Szaban and F. Seredynski, “Cryptographically strong S-boxes based on cellular automata,” in International Conference on Cellular Automata, pp. 478–485, Springer (2008).
[33] G. Tang, X. Liao, and Y. Chen, “A novel method for designing S-boxes based on chaotic maps,” Chaos, Solitons & Fractals, vol. 23, no. 2, pp. 413–419 (2005).
[34] Y. Wang, K. W. Wong, X. Liao, and T. Xiang, “A block cipher with dynamic S-boxes based on tent map,” Communications in Nonlinear Science and Numerical Simulation, vol. 14, no. 7, pp. 3089–3099 (2009).
[35] G. Zaibi, F. Peyrard, A. Kachouri, D. Fournier-Prunaret, and M. Samet, “A new design of dynamic S-box based on two chaotic maps,” in ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2010), pp. 1–6, IEEE (2010).
[36] X. Zhang, Z. Zhao, and J. Wang, “Chaotic image encryption based on circular substitution box and key stream buffer,” Signal Processing: Image Communication, vol. 29, no. 8, pp. 902–913 (2014).

Views: 310Downloads: 4Citations: 0