Skip to main content
SpringerLink
Log in

A Novel Algorithm Enumerating Bent Functions Based on Value Distribution and Run Length

  • Conference paper
  • First Online:
Lecture Notes in Real-Time Intelligent Systems (RTIS 2016)

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

Included in the following conference series:

  • 1647 Accesses

Abstract

Bent function is an important nonlinear function in design of stream cipher and S-box. With more than eight variables Bent functions can only be generated by construction, where, most of these functions are still not found. In this paper, the Bent function search algorithm based on truth table is presented via analyzing the value distribution and run the length of the Bent function. Compared with other searching algorithms, the algorithm proposed in this paper has weak storage complexity and is easy to be implemented by parallel computing.

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

Similar content being viewed by others

References

  1. Rothaus, O.S.: On “Bent” functions. J. Comb. Theory Ser. A 20, 300–305 (1976)

    Article  MATH  Google Scholar 

  2. Cusick, T.W., Stanica, P.: Cryptographic Boolean Functions and Applications. Elsevier Inc., Amsterdam (2009)

    MATH  Google Scholar 

  3. Langevin, P.G.: Leander counting all bent functions in dimension eight 99270589265934370305785861242880. Des. Codes Cryptogr. 59(1–3), 193–205 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Advances in Cryptology—CRYPTO 1991. LNCS, vol. 76, pp. 85–100. Springer (1992)

    Google Scholar 

  5. Leander, G., McGuire, G.: Construction of bent functions from near-bent functions. J. Comb. Theory Ser. A 116(4), 960–970 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gangopadhyay, S., Joshi, A., Leander, G., Sharm, R.K.: A new construction of bent functions based on Z-bent functions. Des. Codes Cryptogr. 66(1–3), 243–256 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Meng, Q.S.H., Yang, M., Zhang, H.G., Cu, J.S.: A novel algorithm enumerating bent functions. J. Discrete Math. DM 308(23), 5576–5584 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Johnson, C.D.: Circular Pipeline: Achieving Higher Throughput in the Search for Bent Functions. Naval Post graduate School, Monterey (2010)

    Google Scholar 

  9. O’Dowd, T.R.: Discovery of Bent Functions Using the Fast Walsh Transform. Naval Postgraduate School, Monterey (2010)

    Google Scholar 

  10. Kolomeets, N.A.: Enumeration of the bent functions of least deviation from a quadratic bent function. J. Appl. Ind. Math. 6(3), 306–317 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Carlet, C., Klapper, A.: Upper bounds on the numbers of resilient functions and of bent functions. In: Proceedings of 23rd Symposium on Information Theory. Benelux, Belgique (2002)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Grant No. 61303263 and 61173151) and Colleges and universities in Hebei province science and technology research project (Grant No. ZD2016020)

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Shijiazhuang Tiedao University, Shijiazhuang, China

    Yongbin Zhao & Chaohui Qi

  2. School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, China

    Fengrong Zhang

Authors
  1. Yongbin Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fengrong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chaohui Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongbin Zhao .

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Opole University , Opole, Opolskie, Poland

    Jolanta Mizera-Pietraszko

  2. Digital Information Research Foundation , Chennai, Tamil Nadu, India

    Pit Pichappan

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Zhao, Y., Zhang, F., Qi, C. (2018). A Novel Algorithm Enumerating Bent Functions Based on Value Distribution and Run Length. In: Mizera-Pietraszko, J., Pichappan, P. (eds) Lecture Notes in Real-Time Intelligent Systems. RTIS 2016. Advances in Intelligent Systems and Computing, vol 613. Springer, Cham. https://doi.org/10.1007/978-3-319-60744-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60744-3_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60743-6

  • Online ISBN: 978-3-319-60744-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation