Skip to main content
SpringerLink
Log in

Two New Approaches to Classify The Boolean Functions

  • Conference paper
  • First Online:
Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1392 ))

  • 445 Accesses

Abstract

Classification of Boolean functions is still remains an open problem for theoretical cryptographers. In this paper, two methods are introduced for systematic classification of Boolean functions for n-variables. First method is an evolutionary approach based on nonlinearity, and second method is recursive. In first method, classification has been done based on nonlinearity. In second method, we started with 1-variable functions and found the classification formula for n-variables.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Correia VP, Reis AI (2001) Classifying n-input boolean functions. In: Proceedings of the 7th Work- shop IBERCHIP (IWS ’01), pp 58–66. IEEE

    Google Scholar 

  2. Slepian D (2018) On the number of symmentric types of boolean functions of n variables. In: Society for industrial and Mathematics, pp 185–193. https://www.cambridge.org/core

  3. Golomb SW (1959) On the classification of boolean functions. IRE Trans. Circuit Theory 6(5), 176–186. IEEE

    Google Scholar 

  4. Harrison MA (1959) On the classification of boolean functions by the general linear and affine groups. J. Soc. Ind. Appl. Math. 12(2), 285–299. IEEE

    Google Scholar 

  5. Braeken A, Borissov Y, Nikova S, Preneel B (2015) Classification of boolean functions of 6 vari- ables or less with respect to cryptographic properties. In: Sixth international scientific conference FMNS2015, At Blagoevgrad, vol 1, pp 311–319. Springer

    Google Scholar 

  6. Rout RK, Choudhury PP, Sahoo S (2013) Classification of boolean functions where affine functions are uniformly distributed. In: Hindawi Publishing Corporation, Journal of Discrete Mathematics, Artical ID 270424, pp 58–66. IEEE

    Google Scholar 

  7. Das JK, Choudhury PP (2014) Classification of n-variable boolean functions through hamming distance and their application in system biology. In: International Journal of Computer Applications (IJCA), pp 0975–8887, NCWBCB, 2014, 11

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Amity University Noida, Noida, India

    Rajni Goyal & Harshit Grewal

  2. Gopisoft Private Limited, New Delhi, India

    Neeraj Gupta

Authors
  1. Rajni Goyal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harshit Grewal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neeraj Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajni Goyal .

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India

    Aruna Tiwari

  2. Computer Science and Engineering, Indian Institute of Technology Indore, Indore, Madhya Pradesh, India

    Kapil Ahuja

  3. Dr. B. R. Ambedkar National Institute of Technology, Jalandhar, India

    Anupam Yadav

  4. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  5. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  6. School of Mathematics, Computer Science and Engineering, Liverpool Hope University, Liverpool, UK

    Atulya K. Nagar

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Goyal, R., Grewal, H., Gupta, N. (2021). Two New Approaches to Classify The Boolean Functions. In: Tiwari, A., Ahuja, K., Yadav, A., Bansal, J.C., Deep, K., Nagar, A.K. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 1392 . Springer, Singapore. https://doi.org/10.1007/978-981-16-2709-5_52

Download citation

Publish with us

Policies and ethics

Search

Navigation