Carlos M I G U E L Legon-Perez (original) (raw)

Uploads

Conference Presentations by Carlos M I G U E L Legon-Perez

Research paper thumbnail of Evaluación de dependencia estadística de entrada- salida de PRNGs mediante el SAC Evaluation of input -output statistical dependence PRNGs by SAC

2016 International Conference on Software Process Improvement (CIMPS), 2016

Resumen-El criterio estricto de avalancha (SAC) es una de las propiedades deseables en las funcio... more Resumen-El criterio estricto de avalancha (SAC) es una de las propiedades deseables en las funciones para ser utilizadas con fines criptográficos. En este trabajo se expone una aplicación de este criterio para evaluar la difusión presente en algoritmos de generación de números pseudoaleatorias (PRNGs). De manera tal, que permita medir la independencia estadística de las salidas con respecto los parámetros de entrada. Palabras Clave-SAC, correlación estadística, difusión, PRNGs Abstract-The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be used for cryptographic purposes. This paper presents an application of this to evaluate the present diffusion algorithms pseudo-random number generation (PRNGs). So, to measure the statistical independence of the outputs towards the input parameters. Keywords-SAC,, statistical correlation, diffusion, PRNGs. I. INTRODUCCIÓN En la criptografía, la difusión y la confusión son dos propiedades que deben de satisfacer los algoritmos de cifrado simétrico, según los criterios de Shannon [1], para prevenir el criptoanálisis. La difusión se centra en la aplicación de ciertas transformaciones con el objetivo de aumentar la complejidad de la dependencia funcional entre la entrada y la salida de un algoritmo criptográfico. Generalmente, en los algoritmos de cifrado en bloque la difusión [2] se obtiene a partir de cierta forma de sustituciones, denominadas s-cajas [2, 3]. Una de las herramientas que han surgido para el análisis de estas es el criterio estricto de avalancha (SAC) [4, 5], con el objetivo de medir la dependencia entre su entrada y salida. Este enfoque es el que se persigue en este trabajo, de manera que puedan verse los PRNGs como una función a la cual se le mide la dependencia estadística entre la entrada y la salida. Así, se podría establecer la dependencia entre las sucesiones generadas y sus respectivas entradas. Además, para evaluar la fortaleza de los PRNGs frente a entradas relacionadas de esta forma. II. DEFINICIONES BÁSICAS Sea el campo binario finito de elementos y el espacio vectorial-dimensional sobre , una función booleana es una aplicación de en , denotada como. De esta manera, se define la función , como la función , expresada como , tal que,

Papers by Carlos M I G U E L Legon-Perez

Research paper thumbnail of Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

IEEE Access, 2020

Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphe... more Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphers against linear, differential, or side-channel attacks is dependent on the design of such component and their intrinsic properties. There are several methods that aim to cryptographically define, generate, or search for strong substitution boxes. The application of combinatorial optimization algorithms is one of the most useful methodologies in this research area. In this article, we present a novel hybrid method based on the Leaders and Followers and hill-climbing over Hamming Weight Classes metaheuristics, coupled with a new trade-off fitness function that generates 8-bit bijective substitution boxes with good resisting properties towards classical cryptanalysis and side-channel attacks by power consumption. We address the best Pareto optimal solutions for the multi-objective optimization of non-linearity and confusion coefficient variance.

Research paper thumbnail of Improved Objective Functions to Search for 8 × 8 Bijective S-Boxes With Theoretical Resistance Against Power Attacks Under Hamming Leakage Models

IEEE Access, 2022

Many research focuses on finding S-boxes with good cryptographic properties applying a heuristic ... more Many research focuses on finding S-boxes with good cryptographic properties applying a heuristic method and a balanced, objective function. The design of S-boxes with theoretical resistance against Side-Channel Attacks by power consumption is addressed with properties defined under one of these two models: the Hamming Distance leakage model and the Hamming Weight leakage model. As far as we know, a balanced search criterion that considers properties under both, at the same time, remains an open problem. We define two new optimal objective functions that can be used to obtain S-boxes with good cryptographic properties values, keeping high theoretical resistance for the two leakage models; we encourage using at least one of our objective functions. We apply a Hill Climbing heuristic method over the S-box's space to measure which objective function is better and to compare the obtained S-boxes with the S-boxes in the actual literature. We also confirm some key relationships between the properties and which property is more suitable to be used. INDEX TERMS S-box, hamming leakage model, transparency order, cryptography, power attack.

Research paper thumbnail of Evaluation of input — output statistical dependence PRNGs by SAC

2016 International Conference on Software Process Improvement (CIMPS), 2016

The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be us... more The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be used for cryptographic purposes. This paper presents an application of this to evaluate the present diffusion algorithms pseudo-random number generation (PRNGs). So, to measure the statistical independence of the outputs towards the input parameters.

Research paper thumbnail of Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

IEEEACCESS, 2020

Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphe... more Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphers against linear, differential, or side-channel attacks is dependent on the design of such component and their intrinsic properties. There are several methods that aim to cryptographically define, generate, or search for strong substitution boxes. The application of combinatorial optimization algorithms is one of the most useful methodologies in this research area. In this article, we present a novel hybrid method based on the Leaders and Followers and hill-climbing over Hamming Weight Classes metaheuristics, coupled with a new trade-off fitness function that generates 8-bit bijective substitution boxes with good resisting properties towards classical cryptanalysis and side-channel attacks by power consumption. We address the best Pareto optimal solutions for the multi-objective optimization of non-linearity and confusion coefficient variance.

Research paper thumbnail of Bit Independence Criterion Extended to Stream Ciphers

Applied Sciences, 2020

The bit independence criterion was proposed to evaluate the security of the S-boxes used in block... more The bit independence criterion was proposed to evaluate the security of the S-boxes used in block ciphers. This paper proposes an algorithm that extends this criterion to evaluate the degree of independence between the bits of inputs and outputs of the stream ciphers. The effectiveness of the algorithm is experimentally confirmed in two scenarios: random outputs independent of the input, in which it does not detect dependence, and in the RC4 ciphers, where it detects significant dependencies related to some known weaknesses. The complexity of the algorithm is estimated based on the number of inputs l, and the dimensions, n and m, of the inputs and outputs, respectively.

Research paper thumbnail of Measuring Independence between Statistical Randomness Tests by Mutual Information

Entropy, 2020

The analysis of independence between statistical randomness tests has had great attention in the ... more The analysis of independence between statistical randomness tests has had great attention in the literature recently. Dependency detection between statistical randomness tests allows one to discriminate statistical randomness tests that measure similar characteristics, and thus minimize the amount of statistical randomness tests that need to be used. In this work, a method for detecting statistical dependency by using mutual information is proposed. The main advantage of using mutual information is its ability to detect nonlinear correlations, which cannot be detected by the linear correlation coefficient used in previous work. This method analyzes the correlation between the battery tests of the National Institute of Standards and Technology, used as a standard in the evaluation of randomness. The results of the experiments show the existence of statistical dependencies between the tests that have not been previously detected.

Research paper thumbnail of Evaluación de dependencia estadística de entrada- salida de PRNGs mediante el SAC Evaluation of input -output statistical dependence PRNGs by SAC

2016 International Conference on Software Process Improvement (CIMPS), 2016

Resumen-El criterio estricto de avalancha (SAC) es una de las propiedades deseables en las funcio... more Resumen-El criterio estricto de avalancha (SAC) es una de las propiedades deseables en las funciones para ser utilizadas con fines criptográficos. En este trabajo se expone una aplicación de este criterio para evaluar la difusión presente en algoritmos de generación de números pseudoaleatorias (PRNGs). De manera tal, que permita medir la independencia estadística de las salidas con respecto los parámetros de entrada. Palabras Clave-SAC, correlación estadística, difusión, PRNGs Abstract-The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be used for cryptographic purposes. This paper presents an application of this to evaluate the present diffusion algorithms pseudo-random number generation (PRNGs). So, to measure the statistical independence of the outputs towards the input parameters. Keywords-SAC,, statistical correlation, diffusion, PRNGs. I. INTRODUCCIÓN En la criptografía, la difusión y la confusión son dos propiedades que deben de satisfacer los algoritmos de cifrado simétrico, según los criterios de Shannon [1], para prevenir el criptoanálisis. La difusión se centra en la aplicación de ciertas transformaciones con el objetivo de aumentar la complejidad de la dependencia funcional entre la entrada y la salida de un algoritmo criptográfico. Generalmente, en los algoritmos de cifrado en bloque la difusión [2] se obtiene a partir de cierta forma de sustituciones, denominadas s-cajas [2, 3]. Una de las herramientas que han surgido para el análisis de estas es el criterio estricto de avalancha (SAC) [4, 5], con el objetivo de medir la dependencia entre su entrada y salida. Este enfoque es el que se persigue en este trabajo, de manera que puedan verse los PRNGs como una función a la cual se le mide la dependencia estadística entre la entrada y la salida. Así, se podría establecer la dependencia entre las sucesiones generadas y sus respectivas entradas. Además, para evaluar la fortaleza de los PRNGs frente a entradas relacionadas de esta forma. II. DEFINICIONES BÁSICAS Sea el campo binario finito de elementos y el espacio vectorial-dimensional sobre , una función booleana es una aplicación de en , denotada como. De esta manera, se define la función , como la función , expresada como , tal que,

Research paper thumbnail of Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

IEEE Access, 2020

Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphe... more Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphers against linear, differential, or side-channel attacks is dependent on the design of such component and their intrinsic properties. There are several methods that aim to cryptographically define, generate, or search for strong substitution boxes. The application of combinatorial optimization algorithms is one of the most useful methodologies in this research area. In this article, we present a novel hybrid method based on the Leaders and Followers and hill-climbing over Hamming Weight Classes metaheuristics, coupled with a new trade-off fitness function that generates 8-bit bijective substitution boxes with good resisting properties towards classical cryptanalysis and side-channel attacks by power consumption. We address the best Pareto optimal solutions for the multi-objective optimization of non-linearity and confusion coefficient variance.

Research paper thumbnail of Improved Objective Functions to Search for 8 × 8 Bijective S-Boxes With Theoretical Resistance Against Power Attacks Under Hamming Leakage Models

IEEE Access, 2022

Many research focuses on finding S-boxes with good cryptographic properties applying a heuristic ... more Many research focuses on finding S-boxes with good cryptographic properties applying a heuristic method and a balanced, objective function. The design of S-boxes with theoretical resistance against Side-Channel Attacks by power consumption is addressed with properties defined under one of these two models: the Hamming Distance leakage model and the Hamming Weight leakage model. As far as we know, a balanced search criterion that considers properties under both, at the same time, remains an open problem. We define two new optimal objective functions that can be used to obtain S-boxes with good cryptographic properties values, keeping high theoretical resistance for the two leakage models; we encourage using at least one of our objective functions. We apply a Hill Climbing heuristic method over the S-box's space to measure which objective function is better and to compare the obtained S-boxes with the S-boxes in the actual literature. We also confirm some key relationships between the properties and which property is more suitable to be used. INDEX TERMS S-box, hamming leakage model, transparency order, cryptography, power attack.

Research paper thumbnail of Evaluation of input — output statistical dependence PRNGs by SAC

2016 International Conference on Software Process Improvement (CIMPS), 2016

The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be us... more The strict avalanche criterion (SAC) is one of the desirable properties in the functions to be used for cryptographic purposes. This paper presents an application of this to evaluate the present diffusion algorithms pseudo-random number generation (PRNGs). So, to measure the statistical independence of the outputs towards the input parameters.

Research paper thumbnail of Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks

IEEEACCESS, 2020

Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphe... more Substitution boxes are the main nonlinear component of block ciphers. The security of these ciphers against linear, differential, or side-channel attacks is dependent on the design of such component and their intrinsic properties. There are several methods that aim to cryptographically define, generate, or search for strong substitution boxes. The application of combinatorial optimization algorithms is one of the most useful methodologies in this research area. In this article, we present a novel hybrid method based on the Leaders and Followers and hill-climbing over Hamming Weight Classes metaheuristics, coupled with a new trade-off fitness function that generates 8-bit bijective substitution boxes with good resisting properties towards classical cryptanalysis and side-channel attacks by power consumption. We address the best Pareto optimal solutions for the multi-objective optimization of non-linearity and confusion coefficient variance.

Research paper thumbnail of Bit Independence Criterion Extended to Stream Ciphers

Applied Sciences, 2020

The bit independence criterion was proposed to evaluate the security of the S-boxes used in block... more The bit independence criterion was proposed to evaluate the security of the S-boxes used in block ciphers. This paper proposes an algorithm that extends this criterion to evaluate the degree of independence between the bits of inputs and outputs of the stream ciphers. The effectiveness of the algorithm is experimentally confirmed in two scenarios: random outputs independent of the input, in which it does not detect dependence, and in the RC4 ciphers, where it detects significant dependencies related to some known weaknesses. The complexity of the algorithm is estimated based on the number of inputs l, and the dimensions, n and m, of the inputs and outputs, respectively.

Research paper thumbnail of Measuring Independence between Statistical Randomness Tests by Mutual Information

Entropy, 2020

The analysis of independence between statistical randomness tests has had great attention in the ... more The analysis of independence between statistical randomness tests has had great attention in the literature recently. Dependency detection between statistical randomness tests allows one to discriminate statistical randomness tests that measure similar characteristics, and thus minimize the amount of statistical randomness tests that need to be used. In this work, a method for detecting statistical dependency by using mutual information is proposed. The main advantage of using mutual information is its ability to detect nonlinear correlations, which cannot be detected by the linear correlation coefficient used in previous work. This method analyzes the correlation between the battery tests of the National Institute of Standards and Technology, used as a standard in the evaluation of randomness. The results of the experiments show the existence of statistical dependencies between the tests that have not been previously detected.