Borislav Stoyanov

Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map

We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments.

Image Encryption Using Chebyshev Map and Rotation Equation

We propose a novel image encryption algorithm based on two pseudorandom bit generators: Chebyshev map based and rotation equation based. The first is used for permutation, and the second one for substitution operations. Detailed security analysis has been provided on the novel image encryption algorithm using visual testing, key space evaluation, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and computational and complexity analysis. Based on the theoretical and empirical results the novel image encryption scheme demonstrates an excellent level of security.

A Novel Pseudorandom Bit Generator Based on Chirikov Standard Map Filtered with Shrinking Rule

This communication proposes a simplified model of pseudorandom bit generator, based on two Chirikov standard maps filtered with shrinking rule. The study also demonstrates that the generated keystreams have excellent properties of randomness and resistance to statistical attacks, which is proven by using the NIST, ENT, and DIEHARD testing suites.

Pseudorandom Bit Generator with Parallel Implementation

In this work we present a new filtering variant of pseudorandom bit generation which combines a 2-adic Feedback with Carry Shift Register and the Editing bit-search generator, based on I. Erguler and E. Anarim research. The generated algorithm uses dynamic blocks for data encryption. Shrinking the block is necessary if low memory is available. The algorithm divides the data block among the cores (the processors) and every core encrypts part of the data file. We show the advantage of using parallel implementation. The experimental statistical results establish the time difference of performance on serial and parallel encryption.