On the Efficiency of Berger Codes Against Error Injection Attacks on Parallel Asynchronous Communication Channels

ABSTRACT

The paper deals with the efficiency of Berger codes under error injection attacks. Berger codes are unordered codes; that is, they are insensitive to propagation delays of individual bits in a codeword. Berger codes are commonly used (in concatenation with linear codes) to provide reliable communication over parallel asynchronous channels. The paper examines the robustness of Berger codes under error injection attacks on the communication channels. It is shown that if the number of information bits is not equal to , where is the number of redundancy bits, then the Berger code is robust; that is, any injected error can be detected.

KEYWORDS:

• asynchronous communication
• Berger code
• fault analysis attacks
• robust codes
• security
• undetected error probability

Additional information

Notes on contributors

Ariel Burg

Osnat Keren received a MSc Degree in Electrical Engineering from the Technion-Israeli Institute of Technology and a PhD Degree from the Tel-Aviv University, Israel, in 1988 and 1999, respectively. Between 1988 and 1994 she held a chip design and senior DSP engineer position at National Semiconductor, and between 1999 and 2003 she was the Senior Scientist of Millimetrix Broadband Networks. Since 2004, Dr. Keren has been with the Faculty of Engineering at Bar-Ilan University, Israel.

Osnat Keren

Ariel Burg received his Bachelor’s Degree in Computer Engineering from Bar-Ilan University, Israel, in 2011. Currently, he is studying toward a second degree in Electrical Engineering at Bar-Ilan University, Israel.