Search

Circulant matrices are of interest on their own as well as for their relevance to several areas of mathematics. In this note vector-circulant matrices over commutative rings are introduced and related results are given. Vector-circulant based additive codes are presented over a particular finite ring. [ABSTRACT FROM AUTHOR]

Considering Z n the ring of integers modulo n, the classical Fermat-Euler theorem establishes the existence of a specific natural number φ (n) satisfying the following property: x φ (n) = 1 for all x belonging to the group of units of Z n. In this manuscript, this result is extended to a class of rings that satisfies some mild conditions. [ABSTRACT FROM AUTHOR]

In the present work, a procedure for determining idempotents of a commutative ring having a sequence of ideals with certain properties is presented. As an application of this procedure, idempotent elements of various commutative rings are determined. Several examples are included illustrating the main results. [ABSTRACT FROM AUTHOR]

In this paper ideals of certain group algebra are used to prove results on k -normal elements over finite fields, including ways to determine them from normal elements by means of polynomials and circulant matrices. Alternative proofs of results appearing in [4] are also provided. [ABSTRACT FROM AUTHOR]

Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. [ABSTRACT FROM AUTHOR]

Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.