Abstract
Robust codes {\mathcal {C}}(n,k)-qC(n,k)q are nonlinear qq-ary codes of dimension kk and length n\leq 2kn≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between nn and kk, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any kk and nn. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.
| Original language | English |
|---|---|
| Article number | 8318671 |
| Pages (from-to) | 511-520 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Dependable and Secure Computing |
| Volume | 16 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 May 2019 |
Bibliographical note
Publisher Copyright:© 2004-2012 IEEE.
Keywords
- High rate robust codes
- fault injection
- hardware security
- lightweight secure architecture
- security oriented codes