Open Access

## M. Chowdhury

DOI:  https://doi.org/10.37418/amsj.9.11.113

#### Full Text

In this paper we give a technique of encryption relating to the point hyperpath of a hypergraph. The technique would relate an $n$ length point hyperpath of which each hyperedge is of order $n$. For encryption of a message with $n$ characters, this would associate a vetex set of order $n^2 -(n-1)$ giving rise to an $n\times n$ matrix. Together with this encryption, the existing available cryptosystem would finally lead to the expected result.

Keywords: Hypergraph, point hyperpath, encrypted message, decrypted message, non-singular matrix.