%0 Conference Paper %1 kikowa014ranking %A Kieselmann, Olga %A Kopal, Nils %A Wacker, Arno %B Socio-technical Design of Ubiquitous Computing Systems %C Berlin %D 2014 %E David, K. %E Geihs, K. %E Leimeister, J. M. %E Roßnagel, A. %E Schmidt, L. %E Stumme, G. %E Wacker, A. %I Springer %K algorithms computing cryptographic myown ranking %P 151-171 %T Ranking Cryptographic Algorithms %U http://dx.doi.org/10.1007/978-3-319-05044-7 %X In many applications of our daily life information security plays a key role. This applies even stronger for ubiquitous computing applications where a multitude of sensors and actuators observe and control our physical environment. When developing such applications a software engineer usually relies on well-known cryptographic mechanisms like encryption or hashing. However, due to the multitude of existing cryptographic algorithms it can be challenging to select an adequate and secure one. A software engineer is not necessarily also an information security expert and, therefore, it is not obvious which one offers enough security. A general method to rank cryptographic algorithms by their strengths would mitigate this problem. With the availability of such a ranking a software engineer can either look up the current ranking of an algorithm or perform the ranking himself to determine the current strength of such an algorithm. In this chapter we present a novel method to rank cryptographic algorithms with respect to their current strengths. We evaluate our method by applying it to existing cryptographic algorithms. %& 9

@inproceedings{kikowa014ranking, abstract = {In many applications of our daily life information security plays a key role. This applies even stronger for ubiquitous computing applications where a multitude of sensors and actuators observe and control our physical environment. When developing such applications a software engineer usually relies on well-known cryptographic mechanisms like encryption or hashing. However, due to the multitude of existing cryptographic algorithms it can be challenging to select an adequate and secure one. A software engineer is not necessarily also an information security expert and, therefore, it is not obvious which one offers enough security. A general method to rank cryptographic algorithms by their strengths would mitigate this problem. With the availability of such a ranking a software engineer can either look up the current ranking of an algorithm or perform the ranking himself to determine the current strength of such an algorithm. In this chapter we present a novel method to rank cryptographic algorithms with respect to their current strengths. We evaluate our method by applying it to existing cryptographic algorithms.}, added-at = {2014-08-11T16:20:52.000+0200}, address = {Berlin}, author = {Kieselmann, Olga and Kopal, Nils and Wacker, Arno}, biburl = {https://www.bibsonomy.org/bibtex/26d20549e7406666910ef841727f2cee5/niko}, booktitle = {Socio-technical Design of Ubiquitous Computing Systems}, chapter = 9, editor = {David, K. and Geihs, K. and Leimeister, J. M. and Roßnagel, A. and Schmidt, L. and Stumme, G. and Wacker, A.}, interhash = {e7adb7ec569bd12978101f3d5bb71106}, intrahash = {6d20549e7406666910ef841727f2cee5}, keywords = {algorithms computing cryptographic myown ranking}, pages = {151-171}, publisher = {Springer}, timestamp = {2014-08-11T16:20:52.000+0200}, title = {Ranking Cryptographic Algorithms}, url = {http://dx.doi.org/10.1007/978-3-319-05044-7}, year = 2014 }