Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.

On Blocking Sets in Affine Hjelmslev Planes

ACM Computing Classification System (1998): G.2.1.

On Affine Connections in a Riemannian Manifold with a Circulant Metric and two Circulant Affinor Structures

Ива Р. Докузова, Димитър Р. Разпопов - В настоящата статия е разгледан клас V оттримерни риманови многообразия M с метрика g и два афинорни тензора q и S. Дефинирана е и друга метрика ¯g в M. Локалните координати на всички тези тензори са циркулантни матрици. Намерени са: 1) зависимост между тензора на кривина R породен от g и тензора на кривина ¯R породен от ¯g; 2) тъждество за тензора на кривина R в случая, когато тензорът на кривина ¯R се анулира; 3) зависимост между секционната кривина на прозволна двумерна q-площадка {x, qx} и скаларната кривина на M.

CAPS in Z(2,n)

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.

Efficient Computing of some Vector Operations over GF(3) and GF(4)

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.

Asplund Functions and Projectional Resolutions of the Identity

*Supported by the Grants AV ˇCR 101-97-02, 101-90-03, GA ˇCR 201-98-1449, and by the Grant of the Faculty of Civil Engineering of the Czech Technical University No. 2003.

An Example Concerning Valdivia Compact Spaces

∗ Supported by Research grants GAUK 190/96 and GAUK 1/1998

Equivariant Embeddings of Differentiable Spaces

Given a differentiable action of a compact Lie group G on a compact smooth manifold V , there exists [3] a closed embedding of V into a finite-dimensional real vector space E so that the action of G on V may be extended to a differentiable linear action (a linear representation) of G on E. We prove an analogous equivariant embedding theorem for compact differentiable spaces (∞-standard in the sense of [6, 7, 8]).

Polynomial Automorphisms Over Finite Fields

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Caractérisation Des Espaces 1-Matriciellement Normés

Let X be a closed subspace of B(H) for some Hilbert space H. In [9], Pisier introduced Sp [X] (1 ≤ p ≤ +∞) by setting Sp [X] = (S∞ [X] , S1 [X])θ , (where θ =1/p , S∞ [X] = S∞ ⊗min X and S1 [X] = S1 ⊗∧ X) and showed that there are p−matricially normed spaces. In this paper we prove that conversely, if X is a p−matricially normed space with p = 1, then there is an operator structure on X, such that M1,n (X) = S1 [X] where Sn,1 [X] is the finite dimentional version of S1 [X]. For p = 1, we have no answer.

The Automorphism Group of the Free Algebra of Rank Two

The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.

Isomorphism Problems for the Baire Function Spaces of Topological Spaces

Let a compact Hausdorff space X contain a non-empty perfect subset. If α < β and β is a countable ordinal, then the Banach space Bα (X) of all bounded real-valued functions of Baire class α on X is a proper subspace of the Banach space Bβ (X). In this paper it is shown that: 1. Bα (X) has a representation as C(bα X), where bα X is a compactification of the space P X – the underlying set of X in the Baire topology generated by the Gδ -sets in X. 2. If 1 ≤ α < β ≤ Ω, where Ω is the first uncountable ordinal number, then Bα (X) is uncomplemented as a closed subspace of Bβ (X). These assertions for X = [0, 1] were proved by W. G. Bade [4] and in the case when X contains an uncountable compact metrizable space – by F.K.Dashiell [9]. Our argumentation is one non-metrizable modification of both Bade’s and Dashiell’s methods.

Three Spaces Problem for Lyapunov Theorem on Vector Measure

It is proved that a Banach space X has the Lyapunov property if its subspace Y and the quotient space X/Y have it.

Uniform Eberlein Compacta and Uniformly Gâteaux Smooth Norms

* Supported by grants: AV ĈR 101-95-02, GAĈR 201-94-0069 (Czech Republic) and NSERC 7926 (Canada).

Fermat's Equation in Matrices

The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.