Abstract
Security-oriented codes are used in cryptographic devices to maximize the probability of detecting fault injection attacks. This paper introduces a new class of binary security-oriented codes of rate {>}{1/2}. The codes are derived from the cubic code by applying a linear transformation on the codewords before puncturing. The codes are systematic and robust in that any nonzero error can be detected with a probability {>}{0}. The error masking probability of the codes is upper bounded by 2{-r+1} where r is the number of redundancy bits. It is shown that in some cases, by choosing the proper transformation and puncturing matrices, it is possible to increase the minimum distance of the code, or to reduce the maximal error masking probability to meet its lower bound.
| Original language | English |
|---|---|
| Article number | 6762956 |
| Pages (from-to) | 2813-2822 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 60 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2014 |
Keywords
- Robust codes
- error masking probability
- fault injection attacks.
- puncturing
- security
- undetected error probability