Role of Statistical tests in Estimation of the Security of a New Encryption Algorithm

TL;DR

This paper evaluates the security of a new encryption algorithm by applying various statistical tests to the generated key sequences to assess their randomness and strength against cryptanalysis.

Contribution

It introduces a new encryption algorithm and applies statistical tests to evaluate the randomness and security of its generated key sequences.

Findings

Sequences pass uniformity tests indicating good randomness

Universal and repetition tests suggest the sequence's robustness against cryptanalysis

Statistical analysis supports the potential security of the new algorithm

Abstract

Encryption study basically deals with three levels of algorithms. The first algorithm deals with encryption mechanism, second deals with decryption Mechanism and the third discusses about the generation of keys and sub keys used in the encryption study. In the given study, a new algorithm is discussed. The algorithm executes a series of steps and generates a sequence. This sequence is being used as sub key to be mapped to plain text to generate cipher text. The strength of the encryption & Decryption process depends on the strength of sequence generated against crypto analysis.. In this part of work some statistical tests like Uniformity tests, Universal tests & Repetition tests are tried on the sequence generated to test the strength of it.