Applications of Soft Computing in Cryptology

Soft computing offers a number of interesting options how to solve many real world problems where security and cryptology domains are not exceptions. There, machine learning and various optimization techniques can play a significant role in finding new, improved solutions. Sometimes those methods are used to solve the problem itself, while sometimes they just represent a helper tool in a larger task. A more in-depth understanding of such techniques is always beneficial. Moreover, the research topics belonging to the intersection of the soft computing and the cryptology are rather demanding since usually neither of those two communities devotes much attention to the other area. In this paper, we briefly discuss three well-known applications of soft computing to the cryptology area where we identify main challenges and offer some possible future research directions.

[1]  Andreas Ibing,et al.  Clustering Algorithms for Non-profiled Single-Execution Attacks on Exponentiations , 2013, CARDIS.

[2]  Olivier Markowitch,et al.  Power analysis attack: an approach based on machine learning , 2014, Int. J. Appl. Cryptogr..

[3]  Claude Carlet,et al.  Vectorial Boolean Functions for Cryptography , 2006 .

[4]  Sylvain Guilley,et al.  Correlation-immune Boolean functions for easing counter measures to side-channel attacks , 2014 .

[5]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[6]  Claude Carlet,et al.  Boolean Functions for Cryptography and Error-Correcting Codes , 2010, Boolean Models and Methods.

[7]  Srinivas Devadas,et al.  Modeling attacks on physical unclonable functions , 2010, CCS '10.

[8]  Ingrid Verbauwhede,et al.  Machine learning attacks on 65nm Arbiter PUFs: Accurate modeling poses strict bounds on usability , 2012, 2012 IEEE International Workshop on Information Forensics and Security (WIFS).

[9]  C. D. Walter,et al.  Sliding Windows Succumbs to Big Mac Attack , 2001, CHES.

[10]  Georg T. Becker,et al.  The Gap Between Promise and Reality: On the Insecurity of XOR Arbiter PUFs , 2015, CHES.

[11]  Mengjie Zhang,et al.  Genetic programming for feature construction and selection in classification on high-dimensional data , 2016, Memetic Comput..

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Srinivas Devadas,et al.  PUF Modeling Attacks on Simulated and Silicon Data , 2013, IEEE Transactions on Information Forensics and Security.

[14]  Annelie Heuser,et al.  Intelligent Machine Homicide - Breaking Cryptographic Devices Using Support Vector Machines , 2012, COSADE.

[15]  Claude Carlet,et al.  Leakage Squeezing of Order Two , 2012, INDOCRYPT.

[16]  Jun Zhang,et al.  Evolutionary Computation Meets Machine Learning: A Survey , 2011, IEEE Computational Intelligence Magazine.

[17]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[18]  Christophe Clavier,et al.  Horizontal Correlation Analysis on Exponentiation , 2010, ICICS.

[19]  David H. Wolpert,et al.  The Lack of A Priori Distinctions Between Learning Algorithms , 1996, Neural Computation.

[20]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[21]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[22]  Nir Friedman,et al.  Bayesian Network Classifiers , 1997, Machine Learning.

[23]  Jasper G. J. van Woudenberg,et al.  Defeating RSA Multiply-Always and Message Blinding Countermeasures , 2011, CT-RSA.

[24]  Julian Francis Miller,et al.  Cryptographic Boolean functions: One output, many design criteria , 2016, Appl. Soft Comput..

[25]  Stjepan Picek,et al.  A New Cost Function for Evolution of S-Boxes , 2016, Evolutionary Computation.

[26]  Joos Vandewalle,et al.  Machine learning in side-channel analysis: a first study , 2011, Journal of Cryptographic Engineering.

[27]  Georg Sigl,et al.  Improving Non-profiled Attacks on Exponentiations Based on Clustering and Extracting Leakage from Multi-channel High-Resolution EM Measurements , 2015, COSADE.

[28]  Romain Poussier,et al.  Template Attacks vs. Machine Learning Revisited (and the Curse of Dimensionality in Side-Channel Analysis) , 2015, COSADE.

[29]  Robert H. Sloan,et al.  Power Analysis Attacks of Modular Exponentiation in Smartcards , 1999, CHES.

[30]  Olivier Markowitch,et al.  A machine learning approach against a masked AES , 2014, Journal of Cryptographic Engineering.

[31]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[32]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[33]  Lejla Batina,et al.  Fault Injection with a New Flavor: Memetic Algorithms Make a Difference , 2015, COSADE.

[34]  Din J. Wasem,et al.  Mining of Massive Datasets , 2014 .

[35]  Carlos A. Coello Coello,et al.  Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance , 2016, EvoCOP.

[36]  Pankaj Rohatgi,et al.  Template Attacks , 2002, CHES.

[37]  Claude Carlet,et al.  Side-channel indistinguishability , 2013, HASP '13.

[38]  Olivier Markowitch,et al.  A Machine Learning Approach Against a Masked AES , 2013, CARDIS.

[39]  Stefan Mangard,et al.  Power analysis attacks - revealing the secrets of smart cards , 2007 .

[40]  William Millan,et al.  An effective genetic algorithm for finding highly nonlinear Boolean Functions , 1997, ICICS.

[41]  Debdeep Mukhopadhyay,et al.  Improved Test Pattern Generation for Hardware Trojan Detection Using Genetic Algorithm and Boolean Satisfiability , 2015, CHES.

[42]  William F. Punch,et al.  Parameter-less population pyramid , 2014, GECCO.