In this paper, we generalize a theorem of Kallman [2, Theorem 1.1] and we resolve the unsettled case there.

In this paper, we propose an improved version of the Simple Matrix encryption scheme of PQCrypto2013. The main goal of our construction is to build a system with even stronger security claims. By using square matrices with random quadratic polynomials, we can claim that breaking the system using algebraic attacks is at least as hard as solving a set of random quadratic equations. Furthermore, due to the use of random polynomials in the matrix A, Rank attacks against our scheme are not feasible.

No abstract uploaded!

No abstract uploaded!

In this paper we generalize an interpolation result due to J.-O. Strömberg and A. Torchinsky to the case of one-sided Hardy spaces. This generalization is important in the study of the weak type (1,1) for lateral strongly singular operators. We shall need an atomic decomposition in which for every atom there exists another atom supported contiguously at its right. In order to obtain this decomposition we have developed a rather simple technique to break up an atom into a sum of others atoms.