Reductive symmetric

The paper presents the results of an analysis of the decrease in cryptographic strength of the most common symmetric ciphers, taking into account the development of cryptanalytic methods. The vector of the threat to the reduction of information confidentiality stored and processed in information systems in the long term has been determined.

7p viyoko 01-10-2024 4 1   Download

In this paper we give a geometric version of the Satake isomorphism [Sat]. As such, it can be viewed as a first step in the geometric Langlands program. The connected complex reductive groups have a combinatorial classification by their root data. In the root datum the roots and the co-roots appear in a symmetric manner and so the connected reductive algebraic groups come ˇ in pairs.

50p noel_noel 17-01-2013 46 6   Download

Let X = G/H be a reductive symmetric space and K a maximal compact subgroup of G. The image under the Fourier transform of the space of K-finite compactly supported smooth functions on X is characterized. Contents 1. Introduction 2. Notation 3. The Paley-Wiener space. Main theorem 4. Pseudo wave packets 5. Generalized Eisenstein integrals 6. Induction of Arthur-Campoli relations 7. A property of the Arthur-Campoli relations 8. Proof of Theorem 4.4 9.

32p noel_noel 17-01-2013 31 5   Download

Characteristic classes for oriented pseudomanifolds can be defined using appropriate self-dual complexes of sheaves. On non-Witt spaces, self-dual complexes compatible to intersection homology are determined by choices of Lagrangian structures at the strata of odd codimension. We prove that the associated signature and L-classes are independent of the choice of Lagrangian structures, so that singular spaces with odd codimensional strata, such as e.g. certain compactifications of locally symmetric spaces, have well-defined L-classes, provided Lagrangian structures exist.

25p noel_noel 17-01-2013 54 7   Download

Reduction of a Symmetric Matrix to Tridiagonal Form for (j=i+1;j= p) p=d[k=j]; if (k != i) { d[k]=d[i]; d[i]=p; for (j=1;j

7p babyuni 17-08-2010 84 6   Download