20,081 research outputs found

    Recursive lattice reduction -- A framework for finding short lattice vectors

    Full text link
    We propose a new framework called recursive lattice reduction for finding short non-zero vectors in a lattice or for finding dense sublattices of a lattice. At a high level, the framework works by recursively searching for dense sublattices of dense sublattices (or their duals). Eventually, the procedure encounters a recursive call on a lattice L\mathcal{L} with relatively low rank kk, at which point we simply use a known algorithm to find a short non-zero vector in L\mathcal{L}. We view our framework as complementary to basis reduction algorithms, which similarly work to reduce an nn-dimensional lattice problem with some approximation factor γ\gamma to an exact lattice problem in dimension k<nk < n, with a tradeoff between γ\gamma, nn, and kk. Our framework provides an alternative and arguably simpler perspective, which in particular can be described without explicitly referencing any specific basis of the lattice, Gram-Schmidt vectors, or even projection (though implementations of algorithms in this framework will likely make use of such things). We present a number of specific instantiations of our framework. Our main concrete result is a reduction that matches the tradeoff between γ\gamma, nn, and kk achieved by the best-known basis reduction algorithms (in terms of the Hermite factor, up to low-order terms) across all parameter regimes. In fact, this reduction also can be used to find dense sublattices with any rank \ell satisfying min{,n}nk+1\min\{\ell,n-\ell\} \leq n-k+1, using only an oracle for SVP (or even just Hermite SVP) in kk dimensions, which is itself a novel result (as far as the authors know). We also show a very simple reduction that achieves the same tradeoff in quasipolynomial time. Finally, we present an automated approach for searching for algorithms in this framework that (provably) achieve better approximations with fewer oracle calls

    Solving the Closest Vector Problem in 2n2^n Time--- The Discrete Gaussian Strikes Again!

    Get PDF
    We give a 2n+o(n)2^{n+o(n)}-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on nn-dimensional Euclidean lattices. This improves on the previous fastest algorithm, the deterministic O~(4n)\widetilde{O}(4^{n})-time and O~(2n)\widetilde{O}(2^{n})-space algorithm of Micciancio and Voulgaris. We achieve our main result in three steps. First, we show how to modify the sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian sampling over lattice shifts, LtL- t, with very low parameters. While the actual algorithm is a natural generalization of [ADRS15], the analysis uses substantial new ideas. This yields a 2n+o(n)2^{n+o(n)}-time algorithm for approximate CVP for any approximation factor γ=1+2o(n/logn)\gamma = 1+2^{-o(n/\log n)}. Second, we show that the approximate closest vectors to a target vector tt can be grouped into "lower-dimensional clusters," and we use this to obtain a recursive reduction from exact CVP to a variant of approximate CVP that "behaves well with these clusters." Third, we show that our discrete Gaussian sampling algorithm can be used to solve this variant of approximate CVP. The analysis depends crucially on some new properties of the discrete Gaussian distribution and approximate closest vectors, which might be of independent interest

    Theoretical Exploration on the Magnetic Properties of Ferromagnetic Metallic Glass: An Ising Model on Random Recursive Lattice

    Full text link
    The ferromagnetic Ising spins are modeled on a recursive lattice constructed from random-angled rhombus units with stochastic configurations, to study the magnetic properties of the bulk Fe-based metallic glass. The integration of spins on the structural glass model well represents the magnetic moments in the glassy metal. The model is exactly solved by the recursive calculation technique. The magnetization of the amorphous Ising spins, i.e. the glassy metallic magnet is investigated by our modeling and calculation on a theoretical base. The results show that the glassy metallic magnets has a lower Curie temperature, weaker magnetization, and higher entropy comparing to the regular ferromagnet in crystal form. These findings can be understood with the randomness of the amorphous system, and agrees well with others' experimental observations.Comment: 11 pages, 5 figure

    Linear degree growth in lattice equations

    Full text link
    We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth and hence are linearizable
    corecore