Search results
Results from the WOW.Com Content Network
In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices.The conjectured intractability of such problems is central to the construction of secure lattice-based cryptosystems: lattice problems are an example of NP-hard problems which have been shown to be average-case hard, providing a test case for the security of cryptographic ...
In some cases, the Schrödinger equation can be solved analytically on a one-dimensional lattice of finite length [6] [7] using the theory of periodic differential equations. [8] The length of the lattice is assumed to be L = N a {\displaystyle L=Na} , where a {\displaystyle a} is the potential period and the number of periods N {\displaystyle ...
Higher-dimensional models contain even more summations. For systems with more than a few particles, such expressions can quickly become too complex to work out directly, even by computer. Instead, the partition function can be rewritten in an equivalent way. The basic idea is to write the partition function in the form
In physics, the Bethe ansatz is an ansatz for finding the exact wavefunctions of certain quantum many-body models, most commonly for one-dimensional lattice models.It was first used by Hans Bethe in 1931 to find the exact eigenvalues and eigenvectors of the one-dimensional antiferromagnetic isotropic (XXX) Heisenberg model.
However, to date, no three-dimensional (3D) problem has had a solution that is both complete and exact. [4] Over the last ten years, Aranovich and Donohue have developed lattice density functional theory (LDFT) based on a generalization of the Ono-Kondo equations to three-dimensions, and used the theory to model a variety of physical phenomena.
An early successful application of the LLL algorithm was its use by Andrew Odlyzko and Herman te Riele in disproving Mertens conjecture. [5]The LLL algorithm has found numerous other applications in MIMO detection algorithms [6] and cryptanalysis of public-key encryption schemes: knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth.
A lattice in the sense of a 3-dimensional array of regularly spaced points coinciding with e.g. the atom or molecule positions in a crystal, or more generally, the orbit of a group action under translational symmetry, is a translation of the translation lattice: a coset, which need not contain the origin, and therefore need not be a lattice in ...
The Short Integer Solution (SIS) problem is an average case problem that is used in lattice-based cryptography constructions. Lattice-based cryptography began in 1996 from a seminal work by Ajtai [ 1 ] who presented a family of one-way functions based on the SIS problem.