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.