Skip to main content
SpringerLink
Log in

An evolutionary approach to construct cryptographically strong Boolean functions

  • Original Article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

Many desirable properties are known for Cryptographically strong Boolean functions. It is difficult task to get optimal trade-off among such properties. Nowadays, the design of strong cryptographic Boolean functions is a multi-objective problem. In this paper we have focused on nonlinearity, autocorrelation and resiliency, and explored an evolutionary approach to construct balanced Boolean functions having the best trade-off among them for 4 and 5 variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Aguirre H, Okazaki H, Fuwa Y (2007) An evolutionary multiobjective approach to design highly non-linear Boolean functions. GECCO’07, 749–756

  • Clark JA, Jacob JL (2000) Two-stage optimization in the design of Boolean functions. In: Proceedings of the 5th Australasian Conference on Information Security and Privacy—ACISP 2000, Springer, LNCS, 1841, pp 242–254

  • Clark JA, Jacob JL, Stepney S, Maitra S, Millan W (2002) Evolving Boolean function satisfying multiple criteria. INDOCRYPT 2002, Springer, LNCS, pp 246–259

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  • Millan W, Clark A, Dawson E (1997) An effective genetic algorithm for finding highly non-linear Boolean functions. In: Proceedings of the First International Conference on Information and Communication Security, Springer, LNCS, 1334, pp 149–158

  • Millan W, Clark A, Dawson E (1998) Heuristic desing of cryptographically strong balanced Boolean functions. In: Proceedings of the advances in cryptology—EUROCRYPT98, Springer, LNCS, 1403, pp 489–499

  • Maitra S, Pasalic E (2002) Further constructions of resilient boolean functions with very high nonlinearity. IEEE Trans Inf Theory 48(7):1825–1834

    Article  MathSciNet  MATH  Google Scholar 

  • Sarkar P, Maitra S (2000) Nonlinearity bounds and construction of resilient Boolean functions. In: Advances in Cryptology—Crypto 2000, Springer, LNCS, 1880, pp 515–532

Download references

Acknowledgments

The first author is thankful to the Ministry of Human Resources and Development, Government of India for financial assistance.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, India

    Rajni Goyal & Shiv Prasad Yadav

Authors
  1. Rajni Goyal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shiv Prasad Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajni Goyal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goyal, R., Yadav, S.P. An evolutionary approach to construct cryptographically strong Boolean functions. Int J Syst Assur Eng Manag 3, 1–5 (2012). https://doi.org/10.1007/s13198-012-0089-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-012-0089-6

Keywords

Search

Navigation