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!

Let$u$_{$n$}be the$n$th term of a Lucas sequence or a Lehmer sequence. In this article we shall establish an estimate from below for the greatest prime factor of$u$_{$n$}which is of the form$n$exp(log$n$/104 log log$n$). In doing so, we are able to resolve a question of Schinzel from 1962 and a conjecture of Erdős from 1965. In addition we are able to give the first general improvement on results of Bang from 1886 and Carmichael from 1912.

In this paper, we study smooth complex projective varieties X such that some exterior power ⋀^rT_X of the tangent bundle is strictly nef. We prove that such varieties are rationally connected. We also classify the following two cases. If T_X is strictly nef, then X isomorphic to the projective space P^n. If ⋀^2T_X is strictly nef and if X has dimension at least 3, then X is either isomorphic to P^n or a quadric Q^n.