Name
Abstract | ||
|---|---|---|
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 optimu... |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TDSC.2018.2816638 | IEEE Transactions on Dependable and Secure Computing |
Keywords | Field | DocType |
Robustness,Hardware,Complexity theory,Security,Systematics,Linear codes | Nonlinear system,Hardware complexity,Computer science,Algorithm,Fault injection,Distributed computing | Journal |
Volume | Issue | ISSN |
16 | 3 | 1545-5971 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hila Rabii | 1 | 1 | 0.35 |
| Yaara Neumeier | 2 | 16 | 2.77 |
| Osnat Keren | 3 | 106 | 20.19 |