Guillermo Sosa-Gómez

Universidad Panamericana

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Omar Rojas

Universidad Panamericana

Carlos Miguel Legón-Pérez

University of Havana

Evaristo José Madarro-Capó

University of Havana

Lisset Suárez-Plasencia

University of Havana

Joaquín Alberto Herrera-Macías

University of Havana

Octavio Páez Osuna

Ronin Institute

Ismel Martínez-Díaz

University of Havana

Raisa Socorro Llanes

Polytechnic José Antonio Echeverría

Alejandro Rosete Suárez

Florida International University

Diego Oliva

Universidad de Guadalajara

Cooperative Institutions

University of Havana

Polytechnic José Antonio Echeverría

Universidad Central "Marta Abreu" de las Villas (UCLV)

Universidad Panamericana

Instituto Politécnico Nacional

Universidad de Guanajuato

Mathematics Research Center

Universidad Panamericana

Universidad de Guadalajara

Universidad Central

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Utilización de la transformada y matrices de Hadamard en las funciones booleanas y en el Criptoanálisis

Guillermo Sosa-Gómez

Source

Cite

Citations (0)

Metaheuristics in the Optimization of Cryptographic Boolean Functions

Entropy (2020)

Isaac López-López Guillermo Sosa-Gómez Carlos Segura Diego Oliva Omar Rojas

Generating Boolean Functions (BFs) with high nonlinearity is a complex task that is usually addresses through algebraic constructions. Metaheuristics have also been applied extensively to this task. However, metaheuristics have not been able to attain so good results as the algebraic techniques. This paper proposes a novel diversity-aware metaheuristic that is able to excel. This proposal includes the design of a novel cost function that combines several information from the Walsh Hadamard Transform (WHT) and a replacement strategy that promotes a gradual change from exploration to exploitation as well as the formation of clusters of solutions with the aim of allowing intensification steps at each iteration. The combination of a high entropy in the population and a lower entropy inside clusters allows a proper balance between exploration and exploitation. This is the first memetic algorithm that is able to generate 10-variable BFs of similar quality than algebraic methods. Experimental results and comparisons provide evidence of the high performance of the proposed optimization mechanism for the generation of high quality BFs.

10.3390/e22091052

Cite

Citations (7)

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

IEEE Access (2022)

Ismel Martínez-Díaz Alejandro Freyre-Echevarría Omar Rojas Guillermo Sosa-Gómez Carlos Miguel Legón-Pérez

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.

Hamming weight

Hamming distance

Leakage (economics)

Hill climbing

Power analysis

10.1109/access.2022.3145990

Cite

Citations (5)

New Weak Keys with Parity Patterns in the RC4 Stream Cipher

Cryptography (2024)

Evaristo José Madarro-Capó Carlos Miguel Legón-Pérez Guillermo Sosa-Gómez Omar Rojas

The RC4 cryptographic algorithm is the most extensively studied stream cipher of the past two decades. This extensive research has resulted in numerous publications, many of which identify various vulnerabilities. Although these vulnerabilities do not preclude the correct use of the algorithm, they complicate its practical implementation. In this paper, we present a novel weakness in the RC4 cipher. Our findings indicate that, for input keys exhibiting certain patterns, the parity of the values in the output permutation of the KSA can be determined with high probability from the parity of its position in the output permutation. Furthermore, the use of keys with these specific patterns leads to noticeable distortions in several bytes of the RC4 output.

RC4

Parity (physics)

10.3390/cryptography8040054

Cite

Citations (0)

Evaluation of input — output statistical dependence PRNGs by SAC

Evaristo J. Madarro Capó Oristela Justiz Cuellar Carlos Morell Guillermo Sosa-Gómez

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.

Independence

Statistical Analysis

10.1109/cimps.2016.7802810

Cite

Citations (10)

Practical Improvement in the Implementation of Two Avalanche Tests to Measure Statistical Independence in Stream Ciphers

Computation (2024)

Evaristo José Madarro-Capó Eziel Christians Ramos Piñón Guillermo Sosa-Gómez Omar Rojas

This study describes the implementation of two algorithms in a parallel environment. These algorithms correspond to two statistical tests based on the bit’s independence criterion and the strict avalanche criterion. They are utilized to measure avalanche properties in stream ciphers. These criteria allow for the statistical independence between the outputs and the internal state of a bit-level cipher to be determined. Both tests require extensive input parameters to assess the performance of current stream ciphers, leading to longer execution times. The presented implementation significantly reduces the execution time of both tests, making them suitable for evaluating ciphers in practical applications. The evaluation results compare the performance of the RC4 and HC256 stream ciphers in both sequential and parallel environments.

Independence

10.3390/computation12030060

Cite

Citations (1)

New Test to Detect Clustered Graphical Passwords in Passpoints Based on the Perimeter of the Convex Hull

Information (2024)

Joaquín Alberto Herrera-Macías Lisset Suárez-Plasencia Carlos Miguel Legón-Pérez Guillermo Sosa-Gómez Omar Rojas

This research paper presents a new test based on a novel approach for identifying clustered graphical passwords within the Passpoints scenario. Clustered graphical passwords are considered a weakness of graphical authentication systems, introduced by users during the registration phase, and thus it is necessary to have methods for the detection and prevention of such weaknesses. Graphical authentication methods serve as a viable alternative to the conventional alphanumeric password-based authentication method, which is susceptible to known weaknesses arising from user-generated passwords of this nature. The test proposed in this study is based on estimating the distributions of the perimeter of the convex hull, based on the hypothesis that the perimeter of the convex hull of a set of five clustered points is smaller than the one formed by random points. This convex hull is computed based on the points that users select as passwords within an image measuring 1920 × 1080 pixels, using the built-in function convhull in Matlab R2018a relying on the Qhull algorithm. The test was formulated by choosing the optimal distribution that fits the data from a total of 54 distributions, evaluated using the Kolmogorov–Smirnov, Anderson–Darling, and Chi-squared tests, thus achieving the highest reliability. Evaluating the effectiveness of the proposed test involves estimating type I and II errors, for five levels of significance α∈{0.01,0.02,0.05,0.1,0.2}, by simulating datasets of random and clustered graphical passwords with different levels of clustering. In this study, we compare the effectiveness and efficiency of the proposed test with existing tests from the literature that can detect this type of pattern in Passpoints graphical passwords. Our findings indicate that the new test demonstrates a significant improvement in effectiveness compared to previously published tests. Furthermore, the joint application of the two tests also shows improvement. Depending on the significance level determined by the user or system, the enhancement results in a higher detection rate of clustered passwords, ranging from 0.1% to 8% compared to the most effective previous methods. This improvement leads to a decrease in the estimated probability of committing a type II error. In terms of efficiency, the proposed test outperforms several previous tests; however, it falls short of being the most efficient, using computation time measured in seconds as a metric. It can be concluded that the newly developed test demonstrates the highest effectiveness and the second-highest efficiency level compared to the other tests available in the existing literature for the same purpose. The test was designed to be implemented in graphical authentication systems to prevent users from selecting weak graphical passwords, enhance password strength, and improve system security.

Perimeter

10.3390/info15080447

Cite

Citations (0)

On the Cryptanalysis of a Simplified AES Using a Hybrid Binary Grey Wolf Optimization

Mathematics (2023)

Rizk M. Rizk‐Allah Hatem Abdul-Kader Samah S. Abd Elatif Diego Oliva Guillermo Sosa-Gómez

Cryptosystem cryptanalysis is regarded as an NP-Hard task in modern cryptography. Due to block ciphers that are part of a modern cipher and have nonlinearity and low autocorrelation in their structure, traditional techniques and brute-force attacks suffer from breaking the key presented in traditional techniques, and brute-force attacks against modern cipher S-AES (simplified-advanced encryption standard) are complex. Thus, developing robust and reliable optimization with high searching capability is essential. Motivated by this, this paper attempts to present a novel binary hybridization algorithm based on the mathematical procedures of the grey wolf optimizer (GWO) and particle swarm optimization (PSO), named BPSOGWO, to deal with the cryptanalysis of (S-AES). The proposed BPSOGWO employs a known plaintext attack that requires only one pair of plaintext–ciphertext pairs instead of other strategies that require more pairs (i.e., it reduces the number of messages needed in an attack, and secret information such as plaintext-ciphertext pairs cannot be obtained easily). The comprehensive and statistical results indicate that the BPSOGWO is more accurate and provides superior results compared to other peers, where it improved the cryptanalysis accurateness of S-AES by 82.5%, 84.79%, and 79.6% compared to PSO, GA, and ACO, respectively. Furthermore, the proposed BPSOGWO retrieves the optimal key with a significant reduction in search space compared to a brute-force attack. Experiments show that combining the suggested fitness function with HPSOGWO resulted in a 109-fold reduction in the search space. In cryptanalysis, this is a significant factor. The results prove that BPSOGWO is a promising and effective alternative to attack the key employed in the S-AES cipher.

Impossible differential cryptanalysis

Brute-force attack

10.3390/math11183982

Cite

Citations (2)

A modified Multifractal Detrended Fluctuation Analysis (MFDFA) approach for multifractal analysis of precipitation

Physica A Statistical Mechanics and its Applications (2020)

Jorge Luis Morales Martínez Ignacio Segovia-Domínguez Israel Quirós Francisco Antonio Horta-Rangel Guillermo Sosa-Gómez

Multifractal system

Hurst exponent

Fractional Brownian motion

10.1016/j.physa.2020.125611

Cite

Citations (43)

Weak PassPoint Passwords Detected by the Perimeter of Delaunay Triangles

Security and Communication Networks (2022)

Lisset Suárez-Plasencia Carlos Miguel Legón-Pérez Joaquín Alberto Herrera-Macías Raisa Socorro Llanes Omar Rojas

PassPoint is a graphical authentication technique that is based on the selection of five points in an image. A detected vulnerability lies in the possible existence of a pattern in the points that make up the password. The objective of this work is to detect nonrandom graphical passwords in the PassPoint scenario. A spatial randomness test based on the average of Delaunay triangles’ perimeter is proposed, given the ineffectiveness of the classic tests in this scenario, which only consists of five points. A state-of-the-art of various applications of Voronoi polygons and Delaunay triangulations are presented to detect clustered and regular patterns. The distributions of the averages of the triangles’ perimeters in the PassPoint scenario for various sizes of images are disclosed, which were unknown. The test’s decision criterion was constructed from one of the best distributions to which the data were adjusted. Type I and type II errors were estimated, and it was concluded that the proposed test could detect clustered and regular graphical passwords in PassPoint, therefore being more effective in detecting clustering than regularity.

Perimeter

10.1155/2022/3624587

Cite

Citations (3)