Paper Info
Title
Punctured Karpovsky-Taubin binary robust error detecting codes for cryptographic devices
Abstract
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, 1−2−r or 1 − 2−r+1. The number of the error vectors associated with each probability is given for robust codes having odd number of information bits.
Year
DOI
Venue
2012
10.1109/IOLTS.2012.6313863
IOLTS
Keywords
Field
DocType
cubic karpovsky-taubin code,error vector,redundancy bit,punctured karpovsky-taubin,cryptographic device,robust code,partially-robust code,binary robust error,odd number,nonzero error,karpovsky-taubin code,zero vector,decision support systems,testing,redundancy,cryptography,codeword,binary codes
Hamming code,Discrete mathematics,Concatenated error correction code,Computer science,Turbo code,Block code,Expander code,Linear code,Reed–Muller code,Tornado code
Conference
ISSN
Citations 
PageRank 
1942-9398
6
0.53
References 
Authors
4
2
Name
Order
Citations
PageRank
Yaara Neumeier1162.77
Osnat Keren210620.19