We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...

The notions of a S fuzzy ∧ sub semi lattice, a S fuzzy ideal and a S fuzzy prime ideal of a bounded lattice with truth values in a bounded ∧ sub semi lattice S are introduced which generalize the existing notions with truth values in a unit interval of real numbers. Finally, S fuzzy prime ideal theorem is proved. 2010 AMS Classification: 03G10, 46H10, 06D50, 08A72

In this paper, new probability estimates are derived for ideal lattice codes from totally real number fields using ideal class Dedekind zeta functions. In contrast to previous work on the subject, it is not assumed that the ideal in question is principal. In particular, it is shown that the corresponding inverse norm sum depends not only on the regulator and discriminant of the number field, bu...

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study ...

As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their huge key size. In this paper, we present a simple weakly homomorphic encryption scheme using only elementary modular arithmetic over the integers rather than working with ideal lattices. Compared with DGHV’s constr...

The “Ring Learning with Errors” (RLWE) problem was formulated as a variant of the “Learning with Errors” (LWE) problem, with the purpose of taking advantage of an additional algebraic structure in the underlying considered lattices; this enables improvements on the efficiency and cipher expansion on those cryptographic applications which were previously based on the LWE problem. In Eurocrypt 20...

In this paper, we draw a connection between ideal lattices and Gröbner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in Z[x]/〈f〉 (Lyubashevsky & Micciancio, 2006) to ideal lattices in Z[x1, . . . , xn]/a, the multivariate case, where f is a polynomial in Z[X] and a is an ideal in Z[x1, . . . , xn]. Ideal lattices in univariate case are interprete...

We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...

We proposed the theory of multi-fuzzy sets [Sabu and Ramakrishnan (2010a), (2011a)] as an extension of theories of fuzzy sets, L-fuzzy sets [Goguen (1967)] and intuitionistic fuzzy sets [Atanassov (1986)]. Theory of multi-fuzzy sets deals with multi-level fuzziness and multi-dimensional fuzziness. Our previous papers discussed the basic notions of multi-fuzzy sets, multi-fuzzy topology, and mul...

Here G is considered as an algebraic group defined over F . The Lie algebra g may be identified with Mn(F ), with Lie bracket [X,Y ] = XY − Y X . The group T is isomorphic to the algebraic torus Gm, T (F ) is isomorphic to (F), and the Lie algebra t is isomorphic to F. The character group X(T ) is the lattice of algebraic homomorphisms T → Gm, the cocharacter group that of algebraic homomorphis...