TY - GEN

T1 - Punctured Karpovsky-Taubin binary robust error detecting codes for cryptographic devices

AU - Neumeier, Yaara

AU - Keren, Osnat

PY - 2012

Y1 - 2012

N2 - Robust and partially robust codes are codes used in cryptographic devices for maximizing the probability of detecting errors injected by malicious attackers. The set of errors that are masked (undetected) by all codewords form the detection-kernel of the code. Codes whose kernel contains only the zero vector, i.e. codes that can detect any nonzero error (of any multiplicity) with probability greater than zero, are called robust. Codes whose kernel is of size greater than one are considered as partially-robust codes. Partially-robust codes of rate greater than one-half can be derived from the the cubic Karpovsky-Taubin code [6]. This paper introduces a construction of robust codes of rate > 1/2. The codes are derived from the Karpovsky-Taubin code by puncturing the redundancy bits. It is shown that if the number of remaining redundancy bits (r) is greater than one then the code is robust and any error vector is detected with probability 1, 12r or 1 2r+1. The number of the error vectors associated with each probability is given for robust codes having odd number of information bits.

AB - Robust and partially robust codes are codes used in cryptographic devices for maximizing the probability of detecting errors injected by malicious attackers. The set of errors that are masked (undetected) by all codewords form the detection-kernel of the code. Codes whose kernel contains only the zero vector, i.e. codes that can detect any nonzero error (of any multiplicity) with probability greater than zero, are called robust. Codes whose kernel is of size greater than one are considered as partially-robust codes. Partially-robust codes of rate greater than one-half can be derived from the the cubic Karpovsky-Taubin code [6]. This paper introduces a construction of robust codes of rate > 1/2. The codes are derived from the Karpovsky-Taubin code by puncturing the redundancy bits. It is shown that if the number of remaining redundancy bits (r) is greater than one then the code is robust and any error vector is detected with probability 1, 12r or 1 2r+1. The number of the error vectors associated with each probability is given for robust codes having odd number of information bits.

UR - http://www.scopus.com/inward/record.url?scp=84869188648&partnerID=8YFLogxK

U2 - 10.1109/iolts.2012.6313863

DO - 10.1109/iolts.2012.6313863

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84869188648

SN - 9781467320849

T3 - Proceedings of the 2012 IEEE 18th International On-Line Testing Symposium, IOLTS 2012

SP - 156

EP - 161

BT - Proceedings of the 2012 IEEE 18th International On-Line Testing Symposium, IOLTS 2012

T2 - 2012 IEEE 18th International On-Line Testing Symposium, IOLTS 2012

Y2 - 27 June 2012 through 29 June 2012

ER -