Generic Parity-Based Concurrent Error Detection for Lightweight ARX Ciphers
Autor: | Stefan Rass, Sergei Bauer, Peter Schartner |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2020 |
Předmět: |
Correctness
General Computer Science Computer science ARX cipher primitive Cryptography 02 engineering and technology Fault detection and isolation Computer Science::Hardware Architecture Gate count transient fault Concurrent error detection Ciphertext 0202 electrical engineering electronic engineering information engineering General Materials Science Circuit complexity Hamming weight business.industry 020208 electrical & electronic engineering General Engineering Computer engineering lightweight cryptography directed acyclic graph 020201 artificial intelligence & image processing lcsh:Electrical engineering. Electronics. Nuclear engineering Error detection and correction Parity (mathematics) business lcsh:TK1-9971 group based parity prediction |
Zdroj: | IEEE Access, Vol 8, Pp 142016-142025 (2020) |
ISSN: | 2169-3536 |
Popis: | Cryptographic functions for constrained processing environments can be devised using lightweight cryptography. For use in safety relevant automotive applications where transient faults can occur at runtime the calculation of a cipher text requires verification. We propose an algorithm to generate a group parity based concurrent error detection for generic ciphers based on addition, rotation and XOR (ARX). The generated function is capable of detecting odd hamming weight faults according to the single event error model used in automotive applications. The the generated fault detection scheme is smaller in circuit size than presently existing concurrent error detection schemes and can be executed parallel to the cryptographic function. We provide a proof for the correctness of the generated prediction function and estimate the circuit complexity in terms of size and depth. We evaluate our solution in terms of gate count and throughput on IC synthesis level. |
Databáze: | OpenAIRE |
Externí odkaz: |