scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Secure communication over Trellis: Graph theoretic approach

TL;DR: This paper has used a class of group codes called Kernel codes and its trellis, to show that private key cryptosystem can be used over Trellis and fundamental cut-set acts as a key to encrypt and decrypt message at sender and receiver respectively.
Abstract: Forney's representation of Trellis code received wide attention by researchers and engineers with its simplicity in representing codes and elegant nature to analyze codes with sys- tem theoretic properties, graph theoretic properties with efficient encoding and decoding procedures. In this paper, we consider the connected graph nature of trellis and propose security feature over Trellis using fundamental cut-set and fundamental circuits principle. We use the graph theoretic approach, by generating limited spanning trees of trellis, fundamental cut-sets and fundamental circuits, private key cryptosystem is defined in which fundamental cut-set acts as a key to encrypt and decrypt. We have used a class of group codes called Kernel codes and its trellis, to show that private key cryptosystem can be used over Trellis and fundamental cut-set acts as a key to encrypt and decrypt message at sender and receiver respectively.
References
More filters
Journal ArticleDOI
TL;DR: It is proved that a particular type of Kernel code is 1 -controllable, which means a group code called Kernel code, which is defined, is 1-controlling.
Abstract: A group code called Kernel code is defined Minimal Trellis of Kernel code is constructed Controllability index of Kernel code is defined It is proved that a particular type of Kernel code is 1 -controllable

9 citations


"Secure communication over Trellis: ..." refers background in this paper

  • ...A. Kernel Codes and Trellis Kernel Codes [12] are a class of group codes defined over finite groups and finite length codes are constructed using such codes....

    [...]

  • ...Kernel codes and its system property such as controllability is discussed in [12] and its application to unconventional DNA construction is discussed in [13]....

    [...]

  • ...Kernel Codes and Trellis Kernel Codes [12] are a class of group codes defined over finite groups and finite length codes are constructed using such codes....

    [...]

Journal ArticleDOI
TL;DR: This paper presents an innovative algorithm for encryption and decryption using connected graphs, which leads to more secure data transfer.
Abstract: Many network applications involve data transfer; therefore there is a need to have a secure network, which can be achieved through the use of cryptography In this paper, we present an innovative algorithm for encryption and decryption using connected graphs Message represented by a connected graph can be encrypted by using a spanning tree of the graph Any message represented in the graph is either on a branch or on a chord with respect to the spanning tree Depending whether it is a branch or a chord graph theorems are applied to the spanning tree for both encryption and decryption purposes This approach used to encrypt leads to more secure data transfer

8 citations


"Secure communication over Trellis: ..." refers background in this paper

  • ...It is showed that fundamental cutset and fundamental circuits can be used for secure communication [11]....

    [...]

Journal ArticleDOI
R. Selvakumar1
TL;DR: An algebraic procedure to construct DNA codes by using homomorphism of groups is provided and the construction procedure is used to determine mutation.
Abstract: One of the key problems in DNA computation is the design of large and reliable codes. Due to the biological and chemical restrictions, DNA codes need to satisfy certain constraints. Here, we provide an algebraic procedure to construct DNA codes by using homomorphism of groups. The construction procedure is used to determine mutation.

5 citations


"Secure communication over Trellis: ..." refers background in this paper

  • ...Kernel codes and its system property such as controllability is discussed in [12] and its application to unconventional DNA construction is discussed in [13]....

    [...]