Abstract

This paper proposes a novel stream encryption scheme with avalanche effect (SESAE). Using this scheme and an ideal pseudorandom number generator (PRNG) to generate d-bit segment binary key streams, one can encrypt a plaintext such that by using any key stream generated from a different seed to decrypt the ciphertext, the decrypted plaintext will become an avalanche-like text which has 2d − 1 consecutive one’s with a high probability. As a cost, the required bits of the ciphertext are d times those of the plaintext. A corresponding avalanche-type encryption theorem is established. Two chaotic 12-bit segment PRNGs are designed. A generalized FIPS140 test and SESAE test for the two chaotic PRNGs, RC4 12-bit segment PRNG and 12-bit segment Matlab PRNG are implemented. The SESAE tests for 16-bit segment PRNGs are also compared. The results suggest that those PRNGs are able to generate the SESAEs which are similar to those generated via ideal PRNGs.

Highlights

  • Chaos-based encryption techniques has received increasing attention recently

  • Any encrypted plaintext using stream encryption scheme with avalanche effect (SESAE) and any key stream generated by pseudorandom number generator (PRNG) has avalanche effect: if any key stream generated by different seeds is used to decrypt an encrypted plaintext, consecutive ones will appear in the decrypted text with a probability of (2d − 1)/2d

  • The avalanche effect of SESAE is investigated, which encrypts and decrypts the image Lina with 128×128 pixels shown in Figure 6a, using PRNG II

Read more

Summary

Introduction

Chaos-based encryption techniques has received increasing attention recently (see, for example, [1,2,3]). Any encrypted plaintext using SESAE and any key stream generated by PRNG has avalanche effect: if any key stream generated by different seeds is used to decrypt an encrypted plaintext, consecutive ones will appear in the decrypted text with a probability of (2d − 1)/2d. Since the distributions of different d-bit segments in Pare homogenous, if cj =∼ pj one still has if one uses the key stream Pto decrypt the ciphertext C, consecutive ones will appear in the decrypted text with a probability of (2d − 1)/2d.

Discrete Chua circuit
Generalized FIPS140-2 test
A novel PRNG and generalized FIPS140-2 test
RC4 algorithm based PRNG and FIPS140-2 test
Simulations on SESAE
Discrete Chen system
Matlab algorithm based PRNG and FIPS140-2 test
Simulation using RC4 PRNG on SESAE
Simulation using Matlab PRNG on SESAE
SESAE experiments for 16-bit segment PRNGs
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call