An Evolutionary Algorithm to Improve the Nonlinearity of Self-inverse S-Boxes

1. Barreto, P.S.L.M., Rijmen, V.: The ANUBIS Block Cipher, http://planeta.terra.com.br/informatica/paulobarreto/AnubisPage.html

2. Chen, H., Feng, D.: An Effective Evolutionary Strategy for Bijective S-Boxes. In: Proceedings of the IEEE Congress on Evolutionary Computation 2004 (CEC 2004), Portland Oregon, June 20-23, pp. 2120–2123 (2004)

   Google Scholar 

3. Chen, H., Feng, D., Wu, W.: An effective algorithm for improving the cryptographic properties of bijective S-Boxes. Journal of Computer Research and Development 41(8), 1410–1414 (2004)

   Google Scholar 

4. Feng, D.-g., Wu, W.-l.: Designing And Analysis of Block Cipher, pp. 67–69. Tsinghua University Press, Beijing (2000)

   Google Scholar 

5. Fuller, J., Millan, W., Dawson, E.: Multi-objective Optimisation of Bijective S-Boxes. In: Proceedings of the IEEE Congress on Evolutionary Computation 2004 (CEC 2004), Portland Oregon, June 20-23, pp. 1525–1532 (2004)

   Google Scholar 

6. Kim, K., Matsumoto, T., Imai, H.: A Recursive Construction Method of S-Boxes Satisfying Strict Avalanche Criterion. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 564–574. Springer, Heidelberg (1991)

   Google Scholar 

7. Millan, W., Burnett, L., Carter, G., Clark, A., Dawson, E.: Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 263–274. Springer, Heidelberg (1999)

   Chapter  Google Scholar 

8. Millan, W.: How to Improve the Nonlinearity of Bijective S-Boxes. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 181–192. Springer, Heidelberg (1998)

   Chapter  Google Scholar 

9. Nyberg, K.: Perfect Nonlinear S-Boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378–386. Springer, Heidelberg (1991)

   Google Scholar 

10. Nyberg, K.: On the Construction of Highly Nonlinear Permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92–98. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

11. Pieprzyk, J.: Non-linearity of Exponent Permutations. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 81–92. Springer, Heidelberg (1990)

    Google Scholar 

12. Pieprzyk, J.: Bent Permutations. In: International Conference on Finite Fields, Coding Theory and Advances in Communications, Las Vegas, pp. 173–181 (1991)

    Google Scholar 

13. Pieprzyk, J., Finkelstein, G.: Permutations that Maximise Non-Linearity and their Cryptographic Significance. In: Proceedings of Fifth IFIP International Conference on Computer Security IFIP/SEC 1988, pp. 63–74 (1988)

    Google Scholar 

14. Pieprzyk, J., Finkelstein, G.: Towards Effective Nonlinear Cryptosystem Design. IEE Proceedings, Pt E. 135(6), 325–335 (1988)

    Google Scholar 

15. Webster, A.F., Tavares, S.E.: On the Design of S-Boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)

    Google Scholar 

16. Seberry, J., Zhang, X.-M., Zheng, Y.: Systematic Generation of Cryptographically Robust S-Boxes. In: Proceedings of the First ACM Conference on Computer and Communications Security, pp. 171–182 (1994)

    Google Scholar 

Download references