Optimization of Acoustic Entropy Source for Random Sequence Generation Using an Improved Grey Wolf Algorithm
Avaroğlu, Erdinç | Kahveci, Semih | Akkurt, Ramazan
The functionality of cryptographic systems necessitates unpredictable, high-quality random numbers. High-quality random numbers must possess unpredictability, non-reproducibility, and strong statistical properties. To achieve these qualities, True Random Number Generators (TRNG) are employed. The randomness quality of TRNG-derived sources depends on the entropy source used. Physical noise sources, ring oscillators, metastable, acoustic sources, and chaotic attractors are commonly used as entropy sources. In recent years, the use of acoustic signals as entropy sources has attracted attention. However, the noise in the signals affects the bit sequence to be generated. In addition, the threshold and sampling interval applied to the frequency values obtained from the signals also determine the...
A New Encryption Algorithm Based on Fibonacci Polynomials and Matrices
Dişkaya, Orhan | Avaroğlu, Erdinç | Menken, Hamza
Confusion and diffusion features are two fundamental needs of encoded text or images. These features have been used in various encryption algorithms such as Advanced Encryption Standard (AES) and Data Encryption Standard (DES). The AES adopts the S- box table formed with irreducible polynomials, while the DES employs the Feistel and S- box structures. This study proposes a new encryption algorithm based on Fibonacci polynomials and matrices, which meets the fundamental needs of image encryption and provides an alternative to other encryption algorithms. The success of the proposed method was tested on three different images, as evidenced by the histogram analysis results of the sample images, together with the number of changing pixel rate (NPCR) and the unified averaged ch...
THE CLASSICAL AES-LIKE CRYPTOLOGY VIA THE FIBONACCI POLYNOMIAL MATRIX
Dişkaya, Orhan | Menken, Hamza
Galois field, has an important position in cryptology. Advanced Encryption Standard (AES) also used in polynomial operations. In this paper, we consider the polynomial operations on the Galois fields, the Fibonacci polynomial sequences. Using a certain irreducible polynomial, we redefine the elements of Fibonacci polynomial sequences to use in our cryptology algorithm. So, we find the classical AES-like cryptology via the Fibonacci polynomial matrix. Successful results were achieved with the method used.