Información del autor
Autor Imaña Pascual, José Luis |
Documentos disponibles escritos por este autor (11)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
El propósito del trabajo de tesis consiste en la aplicación de los campos de Galois a la verificación probabilista de funciones Booleanas, así como en la determinación de métodos de multiplicación sobre los campos de extensión GF(2m) que produzc[...]texto impreso
Barragán García, Vicenta María ; Ruiz Bauzá, Carlos ; Imaña Pascual, José Luis | Elsevier Science BV | 2002-03-01The influence of an alternating (AC) sinusoidal perturbation, of known frequency and small amplitude, superimposed to the usual applied continuous (DC) signal in a desalination electrodialysis process has been studied. The experiments were carri[...]texto impreso
Binary extension (or Galois) fields GF(2^m) have been widely studied due to their use in several important applications, such as cryptography, error control codes and digital signal processing. These applications require efficient hardware imple[...]texto impreso
In this paper, a fast implementation of bit-parallel polynomial basis (PB) multipliers over the binary extension field GF(2^m) generated by type-I irreducible pentanomials is presented. Explicit expressions for the coordinates of the multipliers[...]texto impreso
Imaña Pascual, José Luis ; Luengo Velasco, Ignacio | Institute of Electrical and Electronics | 2020-05The rapid development of quantum computing constitutes a significant threat to modern Public-Key Cryptography (PKC). The use of Shor's algorithm with potential powerful quantum computers could easily break the two most widely used public key cry[...]texto impreso
Efficient hardware implementations of arithmetic operations in the Galois field GF(2^m) are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special[...]texto impreso
Quantum computers have the potential to solve difficult mathematical problems efficiently, therefore meaning an important threat to Public-Key Cryptography (PKC) if large-scale quantum computers are ever built. The goal of Post-Quantum Cryptogra[...]texto impreso
In this article, a new architecture of bit-serial polynomial basis (PB) multipliers over the binary extension field GF(^2m) generated by irreducible trinomials is presented. Bit-serial GF(^2m) PB multiplication offers a performance/area trade-of[...]texto impreso
Quantum computers represent a serious threat to the safety of modern encryption standards. Within symmetric cryptography, Advanced Encryption Standard (AES) is believed to be quantum resistant if the key sizes are large enough. Arithmetic operat[...]texto impreso
Hardware implementations of arithmetic operations over binary finite fields GF(2^m) are widely used in several important applications, such as cryptography, digital signal processing and error-control codes. In this paper, efficient. reconfigura[...]texto impreso
Barragán García, Vicenta María ; Ruiz Bauzá, Carlos ; Imaña Pascual, José Luis | Academic Press Inc Elsevier Science | 2006-02-15Streaming potential measurements across charged membranes separating two equal solutions have been carried out. Two cation-exchange membranes with different cross-linked and swelling properties (Ionics and Nafion membranes) and methanol-water el[...]