Skip to main content

Evolving DPA-Resistant Boolean Functions

  • Conference paper
Book cover Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8672))

Included in the following conference series:

Abstract

Boolean functions are important primitives in cryptography. Accordingly, there exist numerous works on the methods of constructions of Boolean functions. However, the property specifying the resistance of Boolean functions against Differential Power Analysis (DPA) attacks was until now scarcely investigated and only for S-boxes. Here, we evolve Boolean functions that have higher resistance to DPA attacks than others published before by using two well-known evolutionary computation methods where genetic programming shows best performance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aguirre, H., Okazaki, H., Fuwa, Y.: An evolutionary multiobjective approach to design highly non-linear boolean functions. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2007, pp. 749–756 (2007)

    Google Scholar 

  2. Braeken, A.: Cryptographic Properties of Boolean Functions and S-Boxes. PhD thesis, Katholieke Universiteit Leuven (2006)

    Google Scholar 

  3. Burnett, L.: Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. PhD thesis, Faculty of Information Technology, Queensland University of Technology (2005)

    Google Scholar 

  4. Burnett, L., Millan, W., Dawson, E., Clark, A.: Simpler methods for generating better boolean functions with good cryptographic properties. Australasian Journal of Combinatorics 29, 231–247 (2004)

    MathSciNet  MATH  Google Scholar 

  5. Cid, C., Kiyomoto, S., Kurihara, J.: The RAKAPOSHI Stream Cipher. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol. 5927, pp. 32–46. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Jakobovic, D., et al.: Evolutionary computation framework (December 2013), http://gp.zemris.fer.hr/ecf/

  7. Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall/CRC, Boca Raton (2008)

    MATH  Google Scholar 

  8. Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks: Revealing the Secrets of Smart Cards. Advances in Information Security. Springer-Verlag New York, Inc., Secaucus (2007)

    Google Scholar 

  9. Mazumdar, B., Mukhopadhay, D., Sengupta, I.: Constrained Search for a Class of Good Bijective S-Boxes with Improved DPA Resistivity. IEEE Transactions on Information Forensics and Security PP(99), 1 (2013)

    Google Scholar 

  10. McLaughlin, J., Clark, J.A.: Evolving balanced boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. Cryptology ePrint Archive, Report 2013/011 (2013), http://eprint.iacr.org/

  11. Millan, W.L., Clark, A.J., Dawson, E.: Heuristic design of cryptographically strong balanced boolean functions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 489–499. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Picek, S., Ege, B., Batina, L., Jakobovic, D., Chmielewski, L., Golub, M.: On Using Genetic Algorithms for Intrinsic Side-channel Resistance: The Case of AES S-box. In: Proceedings of the First Workshop on Cryptography and Security in Computing Systems, CS2 2014, pp. 13–18. ACM, New York (2014)

    Chapter  Google Scholar 

  13. Picek, S., Jakobovic, D., Golub, M.: Evolving Cryptographically Sound Boolean Functions. In: GECCO (Companion), pp. 191–192 (2013)

    Google Scholar 

  14. Prouff, E.: DPA Attacks and S-Boxes. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 424–441. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Picek, S., Batina, L., Jakobovic, D. (2014). Evolving DPA-Resistant Boolean Functions. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10762-2_80

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10761-5

  • Online ISBN: 978-3-319-10762-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics