Effectiveness of Using Codes With a Sparse Check Matrix for Protection against Algebraic Manipulations

Author(s):  
Alla Levina ◽  
Gleb Ryaskin ◽  
Sergey Taranov ◽  
Anna Polubaryeva
Keyword(s):  
2020 ◽  
Vol 174 (2) ◽  
pp. 137-165
Author(s):  
Nazanin Keshavarzian ◽  
Arsham Borumand Saeid ◽  
Abolfazl Tehranian

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 510 ◽  
Author(s):  
Mumtaz Ali ◽  
Huma Khan ◽  
Le Son ◽  
Florentin Smarandache ◽  
W. Kandasamy

In this paper, we design and develop a new class of linear algebraic codes defined as soft linear algebraic codes using soft sets. The advantage of using these codes is that they have the ability to transmit m-distinct messages to m-set of receivers simultaneously. The methods of generating and decoding these new classes of soft linear algebraic codes have been developed. The notion of soft canonical generator matrix, soft canonical parity check matrix, and soft syndrome are defined to aid in construction and decoding of these codes. Error detection and correction of these codes are developed and illustrated by an example.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Liuguo Yin ◽  
Wentao Hao

Due to the broadcast and time-varying natures of wireless channels, traditional communication systems that provide data encryption at the application layer suffer many challenges such as error diffusion. In this paper, we propose a code-hopping based secrecy transmission scheme that uses dynamic nonsystematic low-density parity-check (LDPC) codes and automatic repeat-request (ARQ) mechanism to jointly encode and encrypt source messages at the physical layer. In this scheme, secret keys at the transmitter and the legitimate receiver are generated dynamically upon the source messages that have been transmitted successfully. During the transmission, each source message is jointly encoded and encrypted by a parity-check matrix, which is dynamically selected from a set of LDPC matrices based on the shared dynamic secret key. As for the eavesdropper (Eve), the uncorrectable decoding errors prevent her from generating the same secret key as the legitimate parties. Thus she cannot select the correct LDPC matrix to recover the source message. We demonstrate that our scheme can be compatible with traditional cryptosystems and enhance the security without sacrificing the error-correction performance. Numerical results show that the bit error rate (BER) of Eve approaches 0.5 as the number of transmitted source messages increases and the security gap of the system is small.


Sign in / Sign up

Export Citation Format

Share Document