Regenerasi Fungsi x²-9x-99 Dalam Pembangkit Bilangan Acak Berbasis CSRPNG Chaos

Abstract

This study examines whether the function f(x)=x²-9x-99 can be used as a key generator in cryptography. The quadratic function is regenerated using the fixed point iteration method into an iteration function. The distribution of digits to the output of iterative function to generate a number of chaos. Randomization testing uses run test and monobit testing. Followed by cryptographic testing to get the correlation between ciphertext and key which will be used as a decision whether the resulting key is random or not. Based on research that has been done iteration function x_i = (x_i-1²-9x_i-1-99)/9 can generate CSRPNG Chaos random numbers with the correlation level closest to the value of 0.