2006
DOI: 10.1007/11767480_21
|View full text |Cite
|
Sign up to set email alerts
|

High Diffusion Cipher: Encryption and Error Correction in a Single Cryptographic Primitive

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 12 publications
0
14
0
Order By: Relevance
“…3 we can see that with 4-Sets-CutDecoding algorithm#3 we have succeeded to eliminate a larger number of null-errors (for p ≥ 0.04, PER c4.3 is from 1.2 to 5.2 times smaller than PER c4.2 ), again without decreasing of the decoding speed. And with the last modification, i.e., 4-Sets-Cut-Decoding algorithm#4, for p > 0.05 we have obtained better results for packeterror probabilities with almost the same decoding speed.…”
Section: Resultsmentioning
confidence: 89%
See 1 more Smart Citation
“…3 we can see that with 4-Sets-CutDecoding algorithm#3 we have succeeded to eliminate a larger number of null-errors (for p ≥ 0.04, PER c4.3 is from 1.2 to 5.2 times smaller than PER c4.2 ), again without decreasing of the decoding speed. And with the last modification, i.e., 4-Sets-Cut-Decoding algorithm#4, for p > 0.05 we have obtained better results for packeterror probabilities with almost the same decoding speed.…”
Section: Resultsmentioning
confidence: 89%
“…Then two algorithms are used, one for error-correcting codes and another for obtaining information security. In order to obtain more efficient design, in the paper [3] authors give one algorithm where a block cipher and an error-correcting code are combined. The main application of their design is for cryptographic purposes, although it can be used as an error-correcting code.…”
Section: Introductionmentioning
confidence: 99%
“…D) is a secure encryption scheme, which means it satisfies the correctness and the security conditions.  Encoding (E, D) is an error-correction scheme and satisfies the coding condition also [7]. In cryptcoding if E and D to denote the encrypt-coding and decrypt-coding algorithm, respectively, the cryptcoding is realized in following two steps [10]: 1.…”
Section: Crypto-codingmentioning
confidence: 99%
“…This can be done by using a new class of codes that we call the high diffusion code (HDcodes) [13] at the diffusion layer. Although, these codes were designed with the specific goal of constructing error correcting ciphers [14], these can also be used for our purposes since the codes provide a means of securely increasing the encryption throughput. Note that, in [14] we first introduced the HDcipher in the electronic codebook (ECB) mode and present a proof-of-concept construction using a specific construction in GF (8).…”
Section: Designing Energy Efficient Ccmpmentioning
confidence: 99%
“…Although, these codes were designed with the specific goal of constructing error correcting ciphers [14], these can also be used for our purposes since the codes provide a means of securely increasing the encryption throughput. Note that, in [14] we first introduced the HDcipher in the electronic codebook (ECB) mode and present a proof-of-concept construction using a specific construction in GF (8). In this mode (and the cipher block chaining mode) the primary function of the HD-cipher is to correct transmission errors.…”
Section: Designing Energy Efficient Ccmpmentioning
confidence: 99%