Decoding network codes using the sum-product algorithm

Gupta, Anindya; Rajan, B. Sundar

doi:10.1109/icc.2016.7510907

Cited by 2 publications

(1 citation statement)

References 13 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A decoding algorithm is the key to determining the decryption complexity. Currently, many decoding algorithms of error-correcting codes can be generally divided into two classes: 1) an algorithm with a strong error-correcting capability and high computational complexity, such as the sum product algorithm (SPA) [23], and 2) an algorithm with low computation complexity, such as the BF decoding algorithm. A comparative analysis between the BF and SPA decoding algorithms when used to decode our novel McEliece cryptosystem is shown in Fig.…”

Section: • Decryption Complexitymentioning

confidence: 99%

Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code

2019

KSII TIIS

View full text Add to dashboard Cite

A code-based cryptosystem can resist quantum-computing attacks. However, an original system based on the Goppa code has a large key size, which makes it unpractical in embedded devices with limited sources. Many special error-correcting codes have recently been developed to reduce the key size, and yet these systems are easily broken through side channel attacks, particularly differential power analysis (DPA) attacks, when they are applied to hardware devices. To address this problem, a higher-order masking scheme for a McEliece cryptosystem based on the quasi-dyadic moderate density parity check (QD-MDPC) code has been proposed. The proposed scheme has a small key size and is able to resist DPA attacks. In this paper, a novel McEliece cryptosystem based on the QD-MDPC code is demonstrated. The key size of this novel cryptosystem is reduced by 78 times, which meets the requirements of embedded devices. Further, based on the novel cryptosystem, a higher-order masking scheme was developed by constructing an extension Ishai-Sahai-Wagne (ISW) masking scheme. The authenticity and integrity analysis verify that the proposed scheme has higher security than conventional approaches. Finally, a side channel attack experiment was also conducted to verify that the novel masking system is able to defend against high-order DPA attacks on hardware devices. Based on the experimental validation, it can be concluded that the proposed higher-order masking scheme can be applied as an advanced protection solution for devices with limited resources.

show abstract

Section: • Decryption Complexitymentioning

confidence: 99%

Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

Reduced Complexity Sum-Product Algorithm for Decoding Nonlinear Network Codes and In-Network Function Computation

Gupta

Rajan

2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

While the capacity, feasibility and methods to obtain codes for network coding problems are well studied, the decoding procedure and complexity have not garnered much attention. In this work, we pose the decoding problem at a sink node in a network as a marginalize a product function (MPF) problem over a Boolean semiring and use the sum-product (SP) algorithm on a suitably constructed factor graph to perform iterative decoding. We use traceback to reduce the number of operations required for SP decoding at sink node with general demands and obtain the number of operations required for decoding using SP algorithm with and without traceback. For sinks demanding all messages, we define fast decodability of a network code and identify a sufficient condition for the same. Next, we consider the in-network function computation problem wherein the sink nodes do not demand the source messages, but are only interested in computing a function of the messages. We present an MPF formulation for function computation at the sink nodes in this setting and use the SP algorithm to obtain the value of the demanded function. The proposed method can be used for both linear and nonlinear as well as scalar and vector codes for both decoding of messages in a network coding problem and computing linear and nonlinear functions in an in-network function computation problem.

show abstract

Decoding network codes using the sum-product algorithm

Cited by 2 publications

References 13 publications

Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code

Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code

Reduced Complexity Sum-Product Algorithm for Decoding Nonlinear Network Codes and In-Network Function Computation

Contact Info

Product

Resources

About