No abstract uploaded!

No abstract uploaded!

In this paper, we attack the recent NIST submission Giophantus, a public key encryption scheme. We find that the complicated structure of Giophantus's ciphertexts leaks information via a correspondence from a low dimensional lattice. This allows us to distinguish encrypted data from random data by the LLL algorithm. This is a more efficient attack than previous proposed attacks.

Nakaoka and Palu introduced the notion of extriangulated categories by extracting the similarities between exact categories and triangulated categories. In this paper, we study cotorsion pairs in a Frobenius extriangulated category $\C$. Especially, for a $2$-Calabi-Yau extriangulated category $\C$ with a cluster structure, we describe the cluster substructure in the cotorsion pairs. For rooted cluster algebras arising from $\C$ with cluster tilting objects, we give a one-to-one correspondence between cotorsion pairs in $\C$ and certain pairs of their rooted cluster subalgebras which we call complete pairs. Finally, we explain this correspondence by an example relating to a Grassmannian cluster algebra.

In this paper, we give an almost complete classication of toric surface codes of dimension less than or equal to 7, according to monomially equivalence. This is a natural extension of our previous work [YZ], [LYZZ]. More pairs of monomially equivalent toric codes constructed from non-equivalent lattice polytopes are discovered. A new phenomenon appears, that is, the monomially non-equivalence of two toric codes C P(10)7and CP(19)7 can be discerned on Fq, for all q  8, except q = 29. This sudden break seems to be strange and interesting. Moreover, the parameters, such as the numbers of codewords with dierent weights, depends on q heavily. More meticulous analyses have been made to have the possible distinct families of reducible polynomials.