Saturday, 5 November 2022

Double Fold Encryption Algorithm Using Adjacency Matrix and Linear Feedback Shift Register (LFSR) as Diffusion | Chapter 3 | Research Highlights in Mathematics and Computer Science Vol. 2

 Sensitive dossier transfer and sharing 'tween two or more legitimate entities have enhance a difficult task on account of indiscriminate and always-increasing usage of cyberspace in technology and route. The sole plan for defending data against high-tech-attacks is to mask the main information along the way. For a very long time, diagram theory plays a important role in encryption. The proximity matrices of undirected graphs, specifically, are used in the current research to evolve a block cypher. The data is encrypted in blocks, accompanying each block having three rounds and each round bearing two different phases: the first point uses an adjacency forge, and the second phase applies a reasonable XOR operation in a particular pattern for each component of the message. The proximity matrix in this place case is known to everyone, and the systems use a linear response shit register (LFSR) to found new matrices for encrypting each block. The diffusion tier in this case is the LFSR. The LFSR polynomial is a secret key that admits the entities to communicate with one another or with a trustworthy third party.

Author(s) Details:

Ch Suneetha,
Department of Mathematics, GITAM University, Visakhapatnam, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V2/article/view/8570

No comments:

Post a Comment