Combinatorial Coverage Analysis of Subsets of the TLS Cipher Suite Registry

Presented as part of the 2016 HCSS conference.

ABSTRACT
We present a combinatorial coverage measurement for (subsets) of the TLS cipher suite registries by analyzing the specific ciphers of IANA, ENISA, BSI, Mozilla and NSA Suite B. Our findings contribute towards the design of quality measures of recommended ciphers for TLS and also lead to important questions regarding the future development of TLS.

BIO
Dr. Dimitris E. Simos is a Key Researcher with SBA Research, Austria, working on mathematical aspects of information security. He is also an Adjunct Lecturer with Vienna University of Technology.

Dimitris has a keen interest on combinatorial designs and error-correcting codes. His research interests extend to the application of combinatorial designs to software testing, combinatorial testing in particular, error-correcting codes and their applications to post-quantum cryptography.

He holds a Ph.D. in Discrete Mathematics and Combinatorics (2011) from the National Technical University of Athens. Prior to joining SBA Research, he was within the Project Team SECRET of INRIA Paris-Rocquencourt Research Center working on the design and analysis of cryptographic algorithms. He has been awarded a Marie Curie Fellowship (2012-2015) and he is also a Fellow of the Institute of Combinatorics and its Applications (FTICA) since 2012.