Every smooth cubic plane curve has 9 flex points and 27 sextatic points. We study the following question asked by Farb: Is it true that the known algebraic structures give all the possible ways to continuously choose n distinct points on every smooth cubic plane curve, for each given positive integer n? We give an affirmative answer to the question when n=9 and 18 (the smallest open cases), and a negative answer for infinitely many n's.

In this paper, we propose a conjectural multiplicity formula for general spherical varieties. For all the cases where a multiplicity formula has been proved, including Whittaker model, Gan-Gross-Prasad model, Ginzburg-Rallis model, Galois model and Shalika model, we show that the multiplicity formula in our conjecture matches the multiplicity formula that has been proved. We also give a proof of this multiplicity formula in two new cases.

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!

No abstract uploaded!