Guillermo Morales-Luna

Learn More
In this contribution, we derive a novel parallel formulation of the standard Itoh-Tsujii algorithm for multiplicative inverse computation overGF(2m). The main building blocks used by our algorithm are: field multiplication, field squaring and field square root operators. It achieves its best performance when using a special class of irreducible trinomials,(More)
We develop an approach of key distribution protocol (KDP) proposed recently by T. Aono et al. A more general mathematical model based on the use of Variable-Directional Antenna (VDA) under the condition of multipath wave propagation is proposed. Statistical characteristics of VDA were investigated by simulation, that allows us to specify model parameters.(More)
We consider a watermark application to assist in the integrity maintenance and verification of the associated images. There is a great benefit in using WM in the context of authentication since it does not require any additional storage space for supplementary metadata, in contrast with cryptographic signatures, for instance. However there is a fundamental(More)
Arithmetic operations over finite fields GF(2<sup>m</sup>) are widely used in cryptography, error-correcting codes and signal processing. In particular, multiplication is especially relevant since other arithmetic operators, such as division or exponentiation, which they usually utilize multipliers as building blocks. Hardware implementation of field(More)
In this paper, we consider the information-theoretic secure key distribution problem over noisy wiretap channels with public discussion and in the presence of an active adversary. There are several well-known versions of the protocols proposed by Maurer and Wolf to solve this problem. We describe several new versions of the key distribution protocols for(More)
We consider a scenario where information hiding (IH) is performed through noisy channels. There may arise different situations but one of the most common is the case where the legal IH channel is superior to the attacker IH channel. If a special randomized encoding is used by legal users then it is possible to hide information in the noisy components of the(More)
The notion of abstract wire-tap channel concept (WTCC) has been proposed by A. Wyner in 1975 and it was later developed by many researchers. This concept executes special randomized encoding in order to prevent information leaking over the wire-tap channel while maintaining a reliable information transmission over the main channel. The difference between(More)
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type of irreducible polynomials. We derive explicit formulae for the space and time complexities associated to the square root operator when working with binary extension fields(More)
Secret key agreement protocol between legal parties based on reconciliation and privacy amplification procedure has been considered in [2]. The so called privacy amplification theorem is used to estimate the amount of Shannon’s information leaking to an illegal party (passive eavesdropper) about the final key. We consider a particular case where one of the(More)