Monobit Test Research Articles

DNA Secret Writing With Laplace Transform of Mittag-Leffler Function

In this study, we present a new cryptosystem named Deoxyribose Nucleic Acid (DNA) secret writing with the Laplace transform of the Mittag-Leffler function. The method is proper for encrypting large files. In this technique, we consider the original message as binary sequence. These binary streams corresponding to the plain text is transformed to DNA bases by utilizing DNA encoding, then the DNA codes are transformed to positive integers. We apply the Laplace transform to these numbers which are coefficients of the expansion of the Mittag-Leffler function. To provide multi-stage protection, the outcome coefficients are transformed to binary sequences and other level of encryption with cumulative XOR is applied and equivalent MSBs obtained at every iteration are utilized for building cipher text. Decryption is implemented in the opposite way. We employ monobit test, correlation analysis for measuring the reliability of encryption, and Python programming language to obtain secret message, the plain text, and computations of statistical tests.

Laplace transform for Mittag-Leffler function in cryptography

The security of information has been a significant part of human civilization since the ancient era. In the information society, the protection of information becomes increasingly crucial for humankind, and new technologies are progressing in an unending stream. Cryptography is one of the greatest methods intended for protecting the transmission of messages and the security of data. For instance, digital commerce, electronic telecommunications such as mobile phone networks, sending personal emails, commercial transactions, paying television, the security of bank cards, cryptocurrency, etc, affect many areas of our everyday lives. Cryptography enables secrecy and protection for secret information by concealing it. It is made through a mathematical method. In this study, we built a new mathematical technique for cryptography in which we applied the Laplace transform (L-Transform) for the Mittag-Leffler function (or E-function) to plain text for encryption and the correspondent inverse L-Transform related to the E-function for decryption. Eventually, we use the Monobit test and correlation test for measuring the security level of encryption and the Python programming language for easily attaining cipher text, the original message, and computations of statistical tests.

The limit joint distributions of statistics of three tests of the NIST package

Abstract For sequences of independent random variables having a Bernoulli distribution the joint distribution and the limit joint distribution of statistics of three tests of the NIST statistical package («Monobit Test», «Frequency Test within a Block», and «Cumulative Sums Test») are obtained. In the case when two blocks are used in «Frequency Test within a Block», pairwise covariance of these statistics is given.

The limit joint distributions of statistics of four tests of the NIST package

Abstract For sequences of independent random variables having a Bernoulli distribution with parameter p the limit joint distribution of statistics of four tests of the NIST statistical package (« Monobit Test », « Frequency Test within a Block », « Runs Test » and a generalization of « Non-overlapping Template Matching Test ») is obtained. Conditions of asymptotic uncorrelatedness and/or asymptotic independence of these statistics are given.

Modified Hill Cipher Algorithm using Myszkowski Transposition to address Known-Plaintext attack

Abstract: Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attack. It is a type of attack wherein the attacker has access to a pair of Plaintext and Ciphertext. Possible leaked information can be used to reveal critical data which can include the private key that is used in the encryption of the plaintext. In this study, the researchers propose an improved scheme by incorporating Myszkowski transposition in the algorithm to address the specified problem. Runtime Test and Statistical test such as the Avalanche effect were used to evaluate the performance of the algorithm. The test yielded a 25.70% faster runtime based on previous modifications and a 52.78% Avalanche Effect. Randomness test such as the Monobit test, Runs Test and Longest Run of Ones in a Block test were applied to evaluate the ciphertext produced. The criterion for the Randomness Test requires its p-value to be greater than 0.01, the evaluation showed a 0.249, 0.167 and 0.368 p-value, respectively. The proposed scheme proved that the algorithm is cryptographically secure and efficient as all tests yielded favorable results. Keywords: Cryptography, Hill Cipher, Encryption, Decryption, Key Generation

Image Encryption Using Multi-Scroll Attractor and Chaotic Logistic Map

In the current scenario, data transmission over the network is a challenging task as there is a need for protecting sensitive data. Traditional encryption schemes are less sensitive and less complex thus prone to attacks during transmission. It has been observed that an encryption scheme using chaotic theory is more promising due to its non-linear and unpredictable behavior. Hence, proposed a novel hybrid image encryption scheme with multi-scroll attractors and quantum chaos logistic maps (MSA-QCLM). The image data is classified as inter-bits and intra-bits which are permutated separately using multi scroll attractor & quantum logistic maps to generate random keys. To increase the encryption efficiency, a hybrid chaotic technique was performed. Experimentation is performed in a Qiskit simulation tool for various image sets. The simulation results and theoretical analysis show that the proposed method is more efficient than its classical counterpart, and its security is verified by the statistical analysis, keys sensitivity, and keyspace analysis. The Number of changing pixel rate (NPCR) & the Unified averaged changed intensity (UACI) values were observed to be 99.6% & 33.4% respectively. Also, entropy oscillates from 7.9 to 7.901 for the different tested encrypted images. The proposed algorithm can resist brute force attacks well, owing to the values of information entropy near the theoretical value of 8. The proposed algorithm has also passed the NIST test (Frequency Monobit test, Run test and DFT test).

Wireless COVID-19 Telehealth: Leukocytes Encryption Guided by Amino Acid Matrix.

In this era of wireless COVID-19 telehealth, visiting hospital for regular follow-ups could invite coronavirus in someone’s body. Opting for proactive E-health services is the best thing. It helps the remote patients to share their confidential data through secured encryption. Telehealth services are emerging element in these proactive medical sciences. It helps the remote patients to share their confidential data through secured transmission. In this paper, amino acid guided matrix encoding scheme has been proposed. White blood cell count or Leukocute count is a dominant indicator of patients’ health condition, even amid COVID-19. An abnormal growth in leukocyte count is mainly caused due to an infection, cancer, or any other severe symptoms. It initiates internal haematological inflammations, cardiovascular diseases, Type II diabetes, etc. Therefore, tracking leukocyte count may for disease diagnosis and further treatments. The leukocyte count is generally done in different pathologies, and the data evaluation needs the expertise of a pathologist. In this paper, a technique involving security measures to transmit the result of the histological test with the help of cryptography has been proposed. The data to be transferred to the concerned physician for further diagnosis with the help of proposed way of encryption using amino acids, which ensures no data loss, no data modification, no data theft in the middle of transmission. The proposed encryption method using the amino acid codes has produced results showing satisfactory performances such as p-values found to be 7.215544e−04 and 8.48904e−03 for the key stream and cipher key matrix monobit test respectively, and 8.10245e−04 and 8.10245e−04 for the key stream and cipher key matrix frequency test respectively. It may be used as a transmission module in any wireless COVID-19 Telehealth Systems.

Encryption Image by Using RC6 and Hybrid Chaotic Map

Cryptography is data processed in a way that becomes incomprehensible and unavailable to unauthorized persons. In this paper instructed method to encryption image by using RC6 algorithm and generated key by using hybrid chaotic map (tent and logistic map). Used some measures such as frequency test within a block, entropy, serial test (two-bit test), and frequency test (monobit test); to demonstrate the strength of the algorithm proposed in the image coding and protection. The MATLAB program was used as a work environment.

Hybrid between Genetic Algorithm and Artificial Bee Colony for Key Generation Purpose

Cryptography is a significant tool for guarantee a protected and secured data. In asymmetric key algorithms, the key generation plays an important role for applied the security. This research focus on enhance genetic algorithm's population by using artificial bee colony to generate keys that are unique and random. The five statistical tests ( Frequency test (monobit test), Serial test (two-bit test), Poker test, runs test and autocorrelation test) are used to compute the fitness. The programming language Pythom3 was used in programming the proposed method. The proposed algorithm is acquired higher quality solutions within a reasonable computational time compared to traditional genetic algorithm.

A Random Bit Generator Using Chaotic Maps

Chaotic systems have many interesting features such as sensitivity on initial condition and system parameter, ergodicity and mixing properties. In this paper, we exploit these interesting properties of chaotic systems to design a random bit generator, called CCCBG, in which two chaotic systems are cross-coupled with each other. To evaluate the randomness of the bit streams generated by the CCCBG, the four basic tests: monobit test, serial test, auto-correlation, Poker test and the most stringent tests of randomness: the NIST suite tests have been performed. As a result no patterns have been observed in the bit streams generated by the proposed CCCBG. The proposed CCCBG can be used in many applications requiring random binary sequences and also in the design of secure cryptosystems.