Let Fqn be an extension of the field Fq of degree n = mpl , l ≥ 1 where p is the characteristic of the field Fq . It is proved that the number of self-dual normal bases generators of Fqn over Fq in (TrFqn |Fqm ) −1(β), for any self-dual normal basis generator β of Fqm over Fq , is independent of the choice of β.

This document defines a mechanism by which a Session Initiation Protocol (SIP) server acting as a traditional Private Branch Exchange (PBX) can register with a SIP Service Provider (SSP) to receive phone calls for SIP User Agents (UAs). In order to function properly, this mechanism requires that each of the Addresses of Record (AORs) registered in bulk map to a unique set of contacts. This requ...

In this work we will show how non-qualified electronic signatures and time stamps can be efficiently enhanced in order to equip them with similar features as qualified ones. In particular we will show how non-qualified electronic signatures can be used in business processes which require the written form. Furthermore we will show how to construct ”interval-qualified” (IQ) time stamps which may ...

In this paper, we describe a new algorithm for discrete logarithms in small characteristic. This algorithm is based on index calculus and includes two new contributions. The first is a new method for generating multiplicative relations among elements of a small smoothness basis. The second is a new descent strategy that allows us to express the logarithm of an arbitrary finite field element in ...

This paper presents an explicit construction for an ((n, k, d), (α, β)) regenerating code over a field FQ operating at the Minimum Storage Regeneration (MSR) point. The parameters of the MSR code can be expressed in terms of two auxiliary parameters (q, t), q ≥ 2, t ≥ 2: n = qt, k = q(t−1), d = (n−1), α = q and β = qt−1. The required field size Q is no larger than n. The MSR code can thus be co...

A significant fraction of search queries relate to topics that are time dependent, where the ideal result changes from one time-span to the next. Despite their prevalance and importance, such queries have been largely ignored. In this paper1, we focus on a subset of temporal queries known as implicitly year qualified queries. Such queries, which include “olympics” and “miss universe” implicitly...