High Rate Robust Codes with Low Implementation Complexity

Hila Rabii, Yaara Neumeier, Osnat Keren

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

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 languageEnglish
Article number8318671
Pages (from-to)511-520
Number of pages10
JournalIEEE Transactions on Dependable and Secure Computing
Volume16
Issue number3
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'High Rate Robust Codes with Low Implementation Complexity'. Together they form a unique fingerprint.

Cite this