Pseudo-Random Binary Generator Based on the Combination of Self-Shrinking Generators

• Autores: Farías, Andrés Francisco; Farías, Andrés Alejandro; Montejano, Germán Antonio; Garis, Ana Gabriela; Riesco, Daniel Eduardo
• Año de publicación: 2025
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Materia: Ciencias Informáticas; Self-Shrinking Generators; Modified Self-Shrinking Generators; LFSR; Cipher; Key; Boolean function
• Institución: Universidad Nacional de La Plata

Various branches of science, such as cryptography, simulation and mathematics, use random or pseudo-random binary sequences. These values are obtained through the use of random or pseudo-random binary generators. These random strings must have a high period and high linear complexity, and must pass statistical randomness tests, to make sure they work. When making a generator, you need to think about all of the above things, and you need to check each step really carefully to make sure that the end result is good. If you combine cryptographic components, you might end up with an unsuitable generator. This project explains how to make a reliable Binary Generator. The generator we're proposing here is made up of two main parts: Self-Shrinking Generators, which are combined using four-variable Boolean functions and a majority function.
Red de Universidades con Carreras en Informática