HyBoDT: Hybrid Bounded Distance Transforms of Trimmed NURBS Models

Distance field representation of objects in 3D space has several applications such as shape manipulation, graphics rendering, path planning, etc. Distance transforms (DTs) are discrete representations of distance fields in a regular voxel grid. The two main limitations of using distance transforms are that they are compute-intensive, and there are errors introduced while representing the object using DTs. In this work, we develop an hybrid GPU-accelerated marching wavefront method for computing DTs of models composed of trimmed NURBS surfaces with theoretical bounds. Our hybrid marching approach eliminates the error due to calculating approximate distances by marching. We also calculate the bounds on the error introduced due to the tessellation of the trimmed NURBS surfaces and calculate the propagation of these bounds in computing the DT. Finally, we present computation times for both 2D and 3D GPU DTs of test objects. We show that our GPU-accelerated approach is significantly faster than existing CPU-based methods.

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.

Consensus and swarming behaviors for a proportional-derivative system with a cut-off interaction

This paper presents a proportional-derivative protocol for the consensus problem of a class of linear second-order multi-agent systems with local information transmission. The communication topology among the agents is switching and agents receive information within a critical bounded distance. As new observations, we show that the desired protocol system undergoes consensus and swarming behaviours when 1 is a simple eigenvalue of the adjacency matrix. In this case, both final velocity and final relative position are formulated. Simulation results show the effectiveness of the proposed protocol.

Lattice Bounded Distance Equivalence for 1D Delone Sets with Finite Local Complexity

Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we characterize, dependingly on digits in the corresponding numeration systems, the spectra which are bounded distance to an average lattice. Our method stems in interpretation of the spectra in the frame of the cut-and-project method. Such structures are coded by an infinite word over a finite alphabet which enables us to exploit combinatorial notions such as balancedness, substitutions and the spectrum of associated incidence matrices.

Number of bounded distance equivalence classes in hulls of repetitive Delone sets

<p style='text-indent:20px;'>Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that the hull of a repetitive Delone set with finite local complexity has either one equivalence class or uncountably many.</p>