A Linear Chaotic Function with Dynamic Constants for Rapid Chaos


P. Karthik
Department of Computer Science, Pondicherry University, Puducherry
P. Shanthi Bala
Department of Computer Science, Pondicherry University


The generation of unique random numbers for the distinct inputs continues a forever research problem. The modern cryptographic applications like Modification Detection Code (MDC) and Message authentication code (MAC) provide an edge to the Chaotic function to provide a security-centric integrity solution. This is because, the chaotic function is a strong one-way function and it involves massive computational power to produce an unpredictable sequence of output symbols for a given input. It recursively applies the logistic map function on every independent element of the input data to generate a significant random sequence. The chaotic function is extremely sensitive to the initial conditions, and it demands backbreaking efforts to find hash collisions. The changes recorded in the output bits between any two consecutive iterations are minimal. Therefore, the chaotic function demands more iterations to foresee the random behavior in its output.

ICICCAS20 Cover Page
July 29, 2020