.png){kind=icon}
返回
High Rate Robust Codes with Low Implementation Complexity
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2018.2816638.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
High rate robust codes
fault injection
hardware security
security oriented codes
lightweight secure architecture
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.5K
被引数:
9.6K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容