We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time: \Find the shortest nonzero vector in an n dimensional lattice L where the shortest vector v is unique in the sense that any other vector whose length is at most n c kvk is parallel to v."

Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since ov...

Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since ov...

Lattice control can unify nonlinear control systems where the basic vector and signal superpositions or transformations are based on the lattice supremum and infimum. In this paper we introduce a special case of lattice control that can model fuzzy dynamical systems in state space. Vector and signal transformations are represented as lattice dilations or erosions. The state and output responses...

We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least π 3 radians; we denote such bases as “nearly orthogonal.” We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are “nearly equal,” then the basis is the unique nearly orthog...

All the identities and integral theorems of vector calculus are contained in the calculus of differential forms. The analogy between the exterior calculus of forms and the homology theory of a cell complex yields discrete lattice models for an array of interesting physical phenomena. These models, based on arbitrary combinations of coupled scalar and polar or axial vector field quantities, can ...

1.1 Basic Definitions Throughout these notes, V will be a finite dimensional Q-vector space. By a lattice in V we mean a finitely generated sybmodule that generates V as a Q-vector space. A subset X ⊆ V is said to be bounded if X is contained in a lattice. For a given function f on V and a vector ` ∈ V we say ` is a period of f if f(x + `) = f(x) for all x ∈ V . The set of all periods of f will...

We present a 2 O(n) time Turing reduction from the closest lattice vector problem to the shortest lattice vector problem. Our reduction assumes access to a subroutine that solves SVP exactly and a subroutine to sample short vectors from a lattice, and computes a (1+)-approximation to CVP. As a consequence, using the SVP algorithm from 1], we obtain a randomized 2 O(1+ ?1)n algorithm to obtain a...