.png){kind=icon}
Return
High Rate Robust Codes with Low Implementation Complexity
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2018.2816638.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Robust codes C(n, k)(q) are nonlinear q-ary codes of dimension k and length n <= 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 n and k, 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 k and n. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.
Keywords:
High rate robust codes
fault injection
hardware security
security oriented codes
lightweight secure architecture
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.5K
Citations:
9.6K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more