Bernoulli logistic map encryption algorithm for digital image

The sophisticated of technology make easy and fast while transfering or saving digital information. There are so many techniques to encrypt data, especially digital image. The algorithm that be use in usually need a long time, although the data was goodly encrypted. But there is better if the encryption time faster with good security. Chaos function can make that possible. Logistic map and Bernoulli map is two of chaos function that can be used on cryptography. This paper will develop new chaotic map, that is composition of Bernoulli map and logistic map, (Bernoulli logistic map) and describe about algorithm digital image encryption using that map. The key sensitivity achieve 10⁻¹⁸ and key space of this algorithm is [(2³¹−1)−b×k×d]×1.6×10⁶³⁴, by b, k, d are measure of row, column, and dimension of the image. It makes hard to break this algorithm by bruteforce attack. Based on test by National Institute of Standards and Technologies (NIST) test, the keystream produced shown to be random. The distribution of pixel intensities is uniform. Moreover, the original digital image and the decrypted digital image from this algorithm is same by PSNR value is ∞.