Encryption based on Conference Matrix

12/23/2019
by   Shipra Kumari, et al.
0

In this article, an encryption scheme based on (-1, 1) conference matrix has been developed. The decryption key comprising of fixed number of positive integers with prime power yields the high level security of message. Some popular attacks has been discussed in the context of cryptoanalysis and observed that it is robust against the popular cipher attack and the security of the information does not compromise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2019

On the security of a Loidreau's rank metric code based encryption scheme

We present a polynomial time attack of a rank metric code based encrypti...
research
05/02/2022

Attack Detection for Networked Control Systems Using Event-Triggered Dynamic Watermarking

Dynamic watermarking schemes can enhance the cyber attack detection capa...
research
10/22/2018

Cryptographic analysis of the Modified Matrix Modular Cryptosystem

We show that the Modified Matrix Modular Cryptosystem proposed by S.K. R...
research
09/05/2022

A Dive into WhatsApp's End-to-End Encryption

We live in a generation where the world around us is witnessing technolo...
research
11/02/2020

Computing Power, Key Length and Cryptanalysis. An Unending Battle?

There are several methods to measure computing power. On the other hand,...
research
10/27/2018

A New Cryptographic Approach: Iterated Random Encryption (IRE)

A new cryptographic approach -- Iterated Random Encryption (IRE) -- is p...
research
12/10/2021

An Evaluation and Enhancement of Seredynski-Bouvry CA-based Encryption Scheme

In this paper, we study a block cipher based on cellular automata, propo...

Please sign up or login with your details

Forgot password? Click here to reset