Search

Your search keyword '"Borges-Trenard, Miguel"' showing total 20 results
Start Over Author "Borges-Trenard, Miguel"
20 results on '"Borges-Trenard, Miguel"'

2. Computing an Invariant of a Linear Code

Author

Borges-Quintana, Mijail, Borges-Trenard, Miguel Ángel, Martínez-Moro, Edgar, Torres-Guerrero, Gustavo, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Slamanig, Daniel, editor, Tsigaridas, Elias, editor, and Zafeirakopoulos, Zafeirakis, editor

Published
2020
Full Text
View/download PDF

3. On zero neighbours and trial sets of linear codes

Author

Borges-Quintana, Mijail, Borges-Trenard, Miguel Angel, and Martinez-Moro, Edgar

Subjects
Computer Science - Information Theory
Abstract

In this work we study the set of leader codewords of a non-binary linear code. This set has some nice properties related to the monotonicity of the weight compatible order on the generalized support of a vector in $\mathbb F_q^n$. This allows us to describe a test set, a trial set and the set zero neighbours in terms of the leader codewords., Comment: Submitted to IEEE Trans. Inf. Th

Published
2014

9. Mejorando la búsqueda de soluciones de sistemas MRHS mediante el Algoritmo Genético.

Author

Tito-Corrioso, Osmani, Borges-Quintana, Mijail, and Borges-Trenard, Miguel A.

Subjects
BLOCK ciphers, GENETIC algorithms, CRYPTOGRAPHY, EQUATIONS
Abstract

Copyright of Revista Cubana de Ciencias Informáticas is the property of Universidad de las Ciencias Informaticas (UCI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Published
2023

10. Ataque al PRESENT-80 con el Algoritmo Genético mediante aproximaciones sucesivas de componentes fijas.

Author

Donatien Charón, Adrian, Borges Trenard, Miguel A., and Borges Quintana, Mijail

Subjects
EVOLUTIONARY algorithms, GENETIC algorithms, BLOCK ciphers, COMPUTER science, CRYPTOGRAPHY, BIBLIOGRAPHIC databases
Abstract

Copyright of Revista Cubana de Ciencias Informáticas is the property of Universidad de las Ciencias Informaticas (UCI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Published
2023

12. An application of genetic algorithm to cryptanalysis of block ciphers by partitioning the key space.

Author

Borges-Trenard, Miguel Á., Borges-Quintana, Mijail, and Monier-Columbié, Lázaro

Subjects
*BLOCK ciphers, *GENETIC algorithms, *CRYPTOGRAPHY, *CIPHERS
Abstract

The genetic algorithm has been used in cryptanalysis. In this paper, we present a general attack to block ciphers by using this algorithm. This method considers the cipher as a black box and it is a known plaintext attack, whose objective is to find the key session. The crucial point of our approach is to make a partition of the key space into subsets determined by the division by a certain divisor, so that one can focus the attack in only some of these subsets. We show how this method can be successfully applied to a member of a block cipher family that contains the AES cipher. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

17. Choosing TMTO Parameters by means of Linear Optimization.

Author

Moreno Ramirez, Jorge, Borges Quintana, Mijail, and Borges Trenard, Miguel Angel

Abstract

In this paper we present a linear optimization model for choosing parameters in the Time Memory Trade Off method (TMTO). The restrictions of the given model are oriented to achieve a feasible TMTO for maximum time and memory given. Experiments confirmed that the proposed scheme determines the parameters in order to get high probability to invert a one-way function. The method can also be applied for combinations of time and memory not included in the reviewed literature. [ABSTRACT FROM PUBLISHER]

Published
2015
Full Text
View/download PDF

18. Complete Presentations of Direct Products of Groups

Author

Borges-Trenard, Miguel, Perez-Roses, Hebert, Borges-Trenard, Miguel, and Perez-Roses, Hebert

Abstract

Complete presentations provide a natural solution to the word problem in monoids and groups. Here we give a simple way to construct complete presentations for the direct product of groups, when such presentations are available for the factors. Actually, the construction we are referring to is just the classical construction for direct products of groups, which has been known for a long time, but whose completeness-preserving properties had not been detected. Using this result and some known facts about Coxeter groups, we sketch an algorithm to obtain the complete presentation of any finite Coxeter group. A similar application to Abelian and Hamiltonian groups is mentioned.

19. Complete Presentations of Direct Products of Groups

Author

Borges-Trenard, Miguel, Perez-Roses, Hebert, Borges-Trenard, Miguel, and Perez-Roses, Hebert

Abstract

Complete presentations provide a natural solution to the word problem in monoids and groups. Here we give a simple way to construct complete presentations for the direct product of groups, when such presentations are available for the factors. Actually, the construction we are referring to is just the classical construction for direct products of groups, which has been known for a long time, but whose completeness-preserving properties had not been detected. Using this result and some known facts about Coxeter groups, we sketch an algorithm to obtain the complete presentation of any finite Coxeter group. A similar application to Abelian and Hamiltonian groups is mentioned.

20. Complete Presentations of Direct Products of Groups

Author

Borges-Trenard, Miguel, Perez-Roses, Hebert, Borges-Trenard, Miguel, and Perez-Roses, Hebert

Abstract

Complete presentations provide a natural solution to the word problem in monoids and groups. Here we give a simple way to construct complete presentations for the direct product of groups, when such presentations are available for the factors. Actually, the construction we are referring to is just the classical construction for direct products of groups, which has been known for a long time, but whose completeness-preserving properties had not been detected. Using this result and some known facts about Coxeter groups, we sketch an algorithm to obtain the complete presentation of any finite Coxeter group. A similar application to Abelian and Hamiltonian groups is mentioned.

Catalog

Books, media, physical & digital resources
See catalog results