Dynamic Selection of Optimal Cryptographic Algorithms in a Runtime Environment

This paper presents the results of research conducted by the author in support of dynamic selection of optimal cryptographic algorithms in a runtime environment (DSOCARE), the author's doctoral dissertation. Based on DSOCARE framework, a first full-scale proof-of-concept prototype was developed by the author in Java and C#/VB. The prototype was used to perform collection, selection, and reporting functions on common symmetric block ciphers, where the collection function included running benchmark tests and storing the data in DBMS located on DSOCARE server. The runtime optimal cryptographic algorithm selector (ROCAS), based on a hybrid genetic algorithm (GA) method, was used to find Pareto-optimal solutions for a diverse array of client security requests with high and low security, speed, and priority quality of service (QoS) parameters. Finally, the reporting function was used to create the data and figures presented in this paper. This paper concludes that adaptive security used in DSOCARE framework mitigates the tradeoff between security, speed, and priority elegantly. It further reinforces the author's thesis that selection of optimal cryptographic algorithms is possible only at runtime.

[1]  Bruce Schneier,et al.  Cryptographic Design Vulnerabilities , 1998, Computer.

[2]  Symeon Papavassiliou,et al.  Integration of mobile agents and genetic algorithms for efficient dynamic network resource allocation , 2001, Proceedings. Sixth IEEE Symposium on Computers and Communications.

[3]  Karsten Schwan,et al.  Authenticast: An Adaptive Protocol for High-Performance, Secure Network Applications , 1997 .

[4]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[5]  Daniel Andresen,et al.  Using implicit fitness functions for genetic algorithm-based agent scheduling , .

[6]  Lawrence Rauchwerger,et al.  An Adaptive Algorithm Selection Framework , 2004, IEEE PACT.

[7]  Peter J. Fleming,et al.  Multiobjective gas turbine engine controller design using genetic algorithms , 1996, IEEE Trans. Ind. Electron..

[8]  Calvin J. Ribbens,et al.  Issues in runtime algorithm selection for grid environments , 2003, Proceedings of the International Workshop on Challenges of Large Applications in Distributed Environments, 2003..

[9]  Phil Benjamin.  Genetic Algorithms for Constrained Service Provisioning , 1999 .

[10]  Victor Eijkhout,et al.  Self-Adapting Numerical Software for Next Generation Applications , 2003, Int. J. High Perform. Comput. Appl..

[11]  J. Raissi.  Performance Impact of Thread Pooling in DSOCARE , 2006, Proceedings of the IEEE SoutheastCon 2006.

[12]  Phyllis Adele Schneck.  Dynamic management of computation and communication resources to enable secure high-performances applications , 1999 .

[13]  J. Raissi,et al.  IPSec Offload Performance , 2004, IEEE SoutheastCon, 2004. Proceedings..

[14]  Jack J. Dongarra,et al.  Automatically Tuned Linear Algebra Software , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[15]  Nancy M. Amato,et al.  STAPL: An Adaptive, Generic Parallel C++ Library , 2001, LCPC.

[16]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Lee Alan Dugatkin.  The Imitation Factor: Evolution Beyond the Gene , 2000 .

[19]  Kroo Ilan,et al.  Multidisciplinary Optimization Methods for Aircraft Preliminary Design , 1994 .

[20]  Ilan Kroo,et al.  A role for genetic algorithms in a preliminary design environment , 1993 .

[21]  Nancy M. Amato,et al.  A framework for adaptive algorithm selection in STAPL , 2005, PPoPP.

[22]  I-Hsin Chung,et al.  Active Harmony: Towards Automated Performance Tuning , 2002, ACM/IEEE SC 2002 Conference (SC'02).