Micciancio defined a generalization of cyclic lattices, called ideal lattices. These lattices can be used in cryptosystems to decrease the number of parameters necessary to describe a lattice by a square root, making them more efficient. He proves that the computational intractability of classic lattice problems for these lattices gives rise to provably secure one-way and collision-resistant hash functions. This provable security relies on the assumption that reducing bases of ideal lattices is similar to reducing bases of random lattices. We give an indication that lattice problems in ideal lattices do not represent the general case by providing a distinguisher, which decides in time O(n^4) whether a given basis of rank spans an ideal lattice or not. Using this algorithm we perform a statistical analysis for several dimensions and show that randomly generated lattices are practically never ideal.

No abstract uploaded!

We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or-type) boundary conditions with continuous wavefunctions, we investigate two types of a singular coupling which are analogous to the interaction and its symmetrized version for a particle on a line. We show that these couplings can be used to model graph superlattices in which point junctions are replaced by complicated geometric scatterers. We also discuss the band spectra for rectangular lattices with the mentioned couplings. We show that they roughly correspond to their Kronig-Penney analogues: the lattices have bands whose widths are asymptotically bounded and do not approach zero, while the lattice gap widths are bounded. However, if the lattice-spacing ratio is an irrational number badly approximable by rationals, and the coupling constant is small

Given a complete noncompact surface embedded in R3, we consider the Dirichlet Laplacian in the layer that is defined as a tubular neighborhood of constant width about . Using an intrinsic approach to the geometry of , we generalize the spectral results of the original paper by Duclos et al. [Commun. Math. Phys. 223, 13 (2001)] to the situation when does not possess poles. This enables us to consider topologically more complicated layers and state new spectral results. In particular, we are interested in layers built over surfaces with handles or several cylindrically symmetric ends. We also discuss more general regions obtained by compact deformations of certain .

In CT-RSA 2019, Bauer et al. have analyzed the case when the public key is reused for the NewHope key encapsulation mechanism (KEM), a second-round candidate in the NIST Post-quantum Standard process. They proposed an elegant method to recover coefficients ranging from −6 to 4 in the secret key. We repeat their experiments but there are two fundamental problems. First, even for coefficients in [−6, 4] we cannot recover at least 262 of them in each secret key with 1024 coefficients. Second, for the coefficient outside [−6, 4], they suggested an exhaustive search. But for each secret key on average there are 10 coefficients that need to be exhaustively searched, and each of them has 6 possibilities. This makes Bauer et al.’s method highly inefficient. We propose an improved method, which with 99.22% probability recovers all the coefficients ranging from −6 to 4 in the secret key. Then, inspired by Ding et al.’s key mismatch attack, we propose an efficient strategy which with a probability of 96.88% succeeds in recovering all the coefficients in the secret key. Experiments show that our proposed method is very efficient, which completes the attack in about 137.56 ms using the NewHope parameters.