No abstract uploaded!

Short integer solution (SIS) and learning with errors (LWE) are two hard lattice problems. These two problems are believed having huge potential in application of cryptography. In 2012, Ding et al. [5] introduced the first provably secure key exchange based on LWE problem. On the other hand, we believe that it is very difficult to do key exchange on SIS problem only. In 2014, Wang et al. [6] did an attempt, but it was not successful. Mao et al. [7] broke the protocol by an attack based on CBi-SIS problem in 2016. However, their attack is not efficient. In this paper, we present a extremely straightforward and simple attack to Wang’s key exchange and then we will construct a key exchange based on SIS and LWE problems.

No abstract uploaded!

In this paper, results on removable singularities for analytic functions, harmonic functions and subharmonic functions by Besicovitch, Carleson, and Shapiro are extended. In each theorem, we need not assume that$f$has the global property at any point, so we are able to allow dense sets of singularities. We do not state our results in terms of exceptional sets, but each one leads to a series of results implying that certain sets are removable for appropriate classes of functions.

We will introduce a quantity which measures the singularity of a plurisubharmonic function$φ$relative to another plurisubharmonic function$ψ$, at a point$a$. We denote this quantity by$ν$_{$a$,$ψ$}($φ$). It can be seen as a generalization of the classical Lelong number in a natural way: if$ψ$=($n$−1)log| ⋅ −$a$|, where$n$is the dimension of the set where$φ$is defined, then$ν$_{$a$,$ψ$}($φ$) coincides with the classical Lelong number of$φ$at the point$a$. The main theorem of this article says that the upper level sets of our generalized Lelong number, i.e. the sets of the form {$z$:$ν$_{$z$,$ψ$}($φ$)≥$c$} where$c$>0, are in fact analytic sets, provided that the$weight$$ψ$satisfies some additional conditions.