No abstract

This paper presents a comparative study involving SHA-3 final round candidates along with recent versions of hash algorithms. The proposed comparison between hash functions is performed with respect to cycles per byte and memory space. Tests are also carried out on a PIC32-based application taking into account several input cases, thus resulting in a set of ranked algorithms in terms of their specified metrics. The outcome of this work represents a considerable contribution in data protection and information security in relation to various communication and transmission systems, serving as a handy reference for developers to select an appropriate hash algorithm for their particular use condition.

In this paper, the performances of SHA-3 final round candidates along with new versions of other hash algorithms are analyzed and compared. An ARM-Cortex A9 microcontroller and a Spartan -3 FPGA circuit are involved in the study, with emphasis placed on the number of cycles and the authentication speed. These hash functions are implemented and tested resulting in a set of ranked algorithms in terms of the specified metrics. Taking into account the performances of the most efficient algorithms and the proposed hardware platform components, an authentication technique can be developed as a possible solution to the limitations and weaknesses of automotive CAN (Controlled Area Network) bus – based embedded systems in terms of security, privacy and integrity. From there, the main elements of such a potential structure are set forth.

<span>In this paper a general overview of the vulnerability of the CAN bus is presented and a practical short-range attack is proposed. There are more and more potential attacks on the CAN bus, which may cause leakage of information and thereby there may be danger for safe driving. The attack combines several techniques, such as how to update a node firmware using a Bluetooth module and inject a priority fake frame, in order to block the legitimate messages. </span>

This paper presents a comparative study involving SHA-3 final round candidates along with recent versions of hash algorithms. The proposed comparison between hash functions is performed with respect to cycles per byte and memory space. Tests are also carried out on a PIC32-based application taking into account several input cases, thus resulting in a set of ranked algorithms in terms of their specified metrics. The outcome of this work represents a considerable contribution in data protection and information security in relation to various communication and transmission systems, serving as a handy reference for developers to select an appropriate hash algorithm for their particular use condition.