Robust Generalized Punctured Cubic Codes

Neumeier, Yaara; Keren, Osnat

doi:10.1109/tit.2014.2310464

Cited by 18 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…code that can detect any (nonzero) error. To date, there are only two such codes, the Quadratic-Sum code [5], [8], and the Punctured-Cubic code [1], [9]. The Quadratic-Sum code is optimum for k = 2r; i.e., Q mc = 2 −r .…”

Section: Hardware Security Problemmentioning

confidence: 99%

“…The Quadratic-Sum code is optimum for k = 2r; i.e., Q mc = 2 −r . The Q mc of the Punctured-Cubic code is smaller or equal to 2 −r+1 , depending on the code's parameters [9].…”

Section: Hardware Security Problemmentioning

confidence: 99%

“…Robust codes with or without pre-mapping [9], [12], [13] are considered as a countermeasure against weak attacks, and Algebraic Manipulation Detection (AMD) codes [7] are considered to be a countermeasure against strong attacks.…”

Section: Role Of Entropy In Code Designmentioning

confidence: 99%

“…The maximal error masking probability depends on the structure of the code, the encoding, and the probability of each codeword to appear. Security oriented codes that can detect any (or almost any) error have been presented in [1], [4]- [6], [9], [10], [18]. These codes were designed for uniformly distributed codewords.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Relations between the Entropy of a Source and the Error Masking Probability for Security Oriented Codes

Keren

Karpovsky

2014

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Security-oriented error-detecting codes are used to detect fault injection attacks on cryptographic devices. These codes are usually designed for uniformly distributed codewords, i.e., for codes that have maximal entropy. In practice, the codewords are not uniformly distributed; thus, their entropy is smaller and their efficiency in detecting attacks degrades. This paper analyzes the relation between the entropy of a code and its worst error masking probability. Based on this relation, a method for determining the rate and structure of a code that provides the required error masking probability is presented. Index Terms-Binary codes, nonlinear codes, error detection, fault injection attacks, information security.Mark Karpovsky (M'80-SM'84-F'91-LF'11) has been a Professor of computer engineering and the Director of the Reliable He has been a Consultant of IBM, Digital Equipment Corporation, Honeywell Corporation, AT&T, Raytheon, and several companies in Europe. He has published more than 200 papers and several books in the areas of logical design, testing and diagnosis of computer systems, fault-tolerant computing, error-correcting codes, and computer communication networks. He conducts research in the areas of design, testing, and diagnosis of computer networks, message routing for multiprocessors and computer communication networks, and design of cryptographic devices resistant to side channel attacks.

show abstract

Section: Hardware Security Problemmentioning

confidence: 99%

“…The Quadratic-Sum code is optimum for k = 2r; i.e., Q mc = 2 −r . The Q mc of the Punctured-Cubic code is smaller or equal to 2 −r+1 , depending on the code's parameters [9].…”

Section: Hardware Security Problemmentioning

confidence: 99%

Section: Role Of Entropy In Code Designmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Relations between the Entropy of a Source and the Error Masking Probability for Security Oriented Codes

Keren

Karpovsky

2014

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…To date, only two systematic robust codes that attain the lower bound are known, the Quadratic-Sum code [10], and the Punctured Cubic (or Punctured Quadratic) code derived from the cubic (quadratic) code by applying a linear transformation on the codewords before deleting part of the redundant bits [1], [14].…”

Section: A Codes Detecting Weak Attacksmentioning

confidence: 99%

Security oriented codes

Keren

2014

2014 IEEE 28th Convention of Electrical &Amp; Electronics Engineers in Israel (IEEEI)

Self Cite

View full text Add to dashboard Cite

Devices with embedded cryptographic modules are prone to fault injection attacks. Modern fault injection techniques allow attackers to inject errors with arbitrary multiplicity. Security oriented codes are considered to be one of the most efficient countermeasures against fault injection attacks. They are designed to detect any injected error with non-zero probability. Their efficiency is usually measured in terms of their error masking probability. This paper presents a brief overview of security oriented codes.

show abstract

A New Construction of Minimum Distance Robust Codes

Rabii

Keren

2017

Coding Theory and Applications

View full text Add to dashboard Cite

Robust Generalized Punctured Cubic Codes

Cited by 18 publications

References 14 publications

Relations between the Entropy of a Source and the Error Masking Probability for Security Oriented Codes

Relations between the Entropy of a Source and the Error Masking Probability for Security Oriented Codes

Security oriented codes

A New Construction of Minimum Distance Robust Codes

Contact Info

Product

Resources

About