Guessing Bits: Improved Lattice Attacks on (EC)DSA with Nonce Leakage

The lattice reduction attack on (EC)DSA (and other Schnorr-like signature schemes) with partially known nonces, originally due to Howgrave-Graham and Smart, has been at the core of many concrete cryptanalytic works, side-channel based or otherwise, in the past 20 years. The attack itself has seen limited development, however: improved analyses have been carried out, and the use of stronger lattice reduction algorithms has pushed the range of practically vulnerable parameters further, but the lattice construction based on the signatures and known nonce bits remain the same.In this paper, we propose a new idea to improve the attack based on the same data in exchange for additional computation: carry out an exhaustive search on some bits of the secret key. This turns the problem from a single bounded distance decoding (BDD) instance in a certain lattice to multiple BDD instances in a fixed lattice of larger volume but with the same bound (making the BDD problem substantially easier). Furthermore, the fact that the lattice is fixed lets us use batch/preprocessing variants of BDD solvers that are far more efficient than repeated lattice reductions on non-preprocessed lattices of the same size. As a result, our analysis suggests that our technique is competitive or outperforms the state of the art for parameter ranges corresponding to the limit of what is achievable using lattice attacks so far (around 2-bit leakage on 160-bit groups, or 3-bit leakage on 256-bit groups).We also show that variants of this idea can also be applied to bits of the nonces (leading to a similar improvement) or to filtering signature data (leading to a data-time trade-off for the lattice attack). Finally, we use our technique to obtain an improved exploitation of the TPM–FAIL dataset similar to what was achieved in the Minerva attack.

Dist Frequent Next Neighbours: A Distributed Galois Lattice Algorithm for Frequent Closed Itemsets Extraction

The general purpose of this paper is to propose a distributed version of frequent closed itemsets extraction in the context of big data. The goal is to have good performances of frequent closed itemsets extraction as frequent closed item-sets are bases for frequent itemsets. To achieve this goal, we have extended the Galois lattice technique (or concept lattice) in this context. Indeed, Galois lattices are an efficient alternative for extracting closed itemsets which are interesting approaches for generating frequent itemsets. Thus we proposed Dist Frequent Next Neighbour which is a distributed version of the Frequent Next Neighbour concept lattice construction algorithm, which considerably reduces the extraction time by parallelizing the computation of frequent concepts (closed itemsets).

Amalgamation and Injectivity in Banach Lattices

We study distinguished objects in the category $\mathcal{B}\mathcal{L}$ of Banach lattices and lattice homomorphisms. The free Banach lattice construction introduced by de Pagter and Wickstead [ 8] generates push-outs, and combining this with an old result of Kellerer [ 17] on marginal measures, the amalgamation property of Banach lattices is established. This will be the key tool to prove that $L_1([0,1]^{\mathfrak{c}})$ is separably $\mathcal{B}\mathcal{L}$-injective, as well as to give more abstract examples of Banach lattices of universal disposition for separable sublattices. Finally, an analysis of the ideals on $C(\Delta ,L_1)$, which is a separably universal Banach lattice as shown by Leung et al. [ 21], allows us to conclude that separably $\mathcal{B}\mathcal{L}$-injective Banach lattices are necessarily non-separable.

G. Czédli’s tolerance factor lattice construction and weak ordered relations

G. Czédli proved that the blocks of any compatible tolerance T of a lattice L can be ordered in such a way that they form a lattice L/T called the factor lattice of L modulo T. Here we show that the Dedekind–MacNeille completion of the lattice L/T is isomorphic to the concept lattice of the context (L, L, R), where R stands for the reflexive weak ordered relation $$ \mathord {\le } \circ T$$ ≤ ∘ T . Weak ordered relations constitute the generalization of the ordered relations introduced by S. Valentini. Reflexive weak ordered relations can be characterized as compatible reflexive relations $$R\subseteq L^{2}$$ R ⊆ L 2 satisfying $$R=\ \mathord {\le } \circ R\circ \mathord {\le } $$ R = ≤ ∘ R ∘ ≤ .

Exotic $U(1)$ symmetries, duality, and fractons in 3+1-dimensional quantum field theory

We extend our exploration of nonstandard continuum quantum field theories in 2+12+1 dimensions to 3+13+1 dimensions. These theories exhibit exotic global symmetries, a peculiar spectrum of charged states, unusual gauge symmetries, and surprising dualities. Many of the systems we study have a known lattice construction. In particular, one of them is a known gapless fracton model. The novelty here is in their continuum field theory description. In this paper, we focus on models with a global U(1)U(1) symmetry and in a followup paper we will study models with a global \mathbb{Z}_NℤN symmetry.

Lattice AdS geometry and continuum limit

We construct the lattice AdS geometry. The lattice AdS2 geometry and AdS3 geometry can be extended from the lattice AdS2 induced metric, which provided the lattice Schwarzian theory at the classical limit. Then we use the lattice embedding coordinates to rewrite the lattice AdS2 geometry and AdS3 geometry with the manifest isometry. The lattice AdS2 geometry can be obtained from the lattice AdS3 geometry through the compactification without the lattice artifact. The lattice embedding coordinates can also be used in the higher-dimensional AdS geometry. Because the lattice Schwarzian theory does not suffer from the issue of the continuum limit, the lattice AdS2 geometry can be obtained from the higher-dimensional AdS geometry through the compactification, and the lattice AdS metric does not depend on the angular coordinates, we expect that the continuum limit should exist in the lattice Einstein gravity theory from this geometric lattice AdS geometry. Finally, we apply this lattice construction to construct the holographic tensor network without the issue of a continuum limit.

Images of Linear Conditions on a Manhattan Plane

In this paper are considered planar point sets generated by linear conditions, which are realized in rectangular or Manhattan metric. Linear conditions are those expressed by the finite sum of the products of distances by numerical coefficients. Finite sets of points and lines are considered as figures defining linear conditions. It has been shown that linear conditions can be defined relative to other planar figures: lines, polygons, etc. The design solutions of the following general geometric problem are considered: for a finite set of figures (points, line segments, polygons...) specified on a plane with a rectangular metric, which are in a common position, it is necessary to construct sets that satisfy any linear condition. The problems in which the given sets are point and segment ones have been considered in detail, and linear conditions are represented as a sum or as relations of distances. It is proved that solution result can be isolated points, broken lines, and areas on the plane. Sets of broken lines satisfying the given conditions form families of isolines for the given condition. An algorithm for building isoline families is presented. The algorithm is based on the Hanan lattice construction and the isolines behavior in each node and each sub-region of the lattice. For isoline families defined by conditions for relation of distances, some of their properties allowing accelerate their construction process are proved. As an example for application of the described theory, the problem of plane partition into regions corresponding to a given set of points, lines and other figures is considered. The problem is generalized problem of Voronoi diagram construction, and considered in general formulation. It means the next: 1) the problem is considered in rectangular metric; 2) all given points may be integrated in various figures – separate points, line segments, triangles, quadrangles etc.; 3) the Voronoi diagram’s property of proximity is changed for property of proportionality. Have been represented examples for plane partition into regions, determined by two-point sets.

Software for Model Preparation of Transmission Lattice Construction

This paper presents the preparation phase for model of transmission tower lattice construction using ANSYS APDL environment. Beam elements are used for the model which introduce complications in the preparation phase because of the need to define the beam shape. Considering that the lattice construction of the transmission tower consists of hundreds of trusses it is obvious that some auxiliary tool is necessary for preparation of such model in ANSYS APDL. This tool was programmed in SW Wolfram Mathematica.