Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP

The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.

Global and local coordinates

This chapter described the global and local coordinate systems utilized in the formulation of spatial multibody systems. Global coordinate system is considered in the present work to denote the inertia frame. Additionally, body-fixed coordinate systems, also called local coordinate systems, are utilized to describe local properties of points that belong to a particular body. Furthermore, the process of transforming local coordinates into global coordinates is characterized by considering a transformation matrix. In the present work, Cartesian coordinates are utilized to locate the center of mass of each rigid body, as well as the location of any point that belongs to a body.

Vector of coordinates, velocities and accelerations

This chapter describes the how the vector of coordinates are defined in the formulation of spatial multibody systems. For this purpose, the translational motion is described in terms of Cartesian coordinates, while rotational motion is specified using the technique of Euler parameters. This approach avoids the computational difficulties associated with the singularities in the case of using Euler angles or Bryant angles. Moreover, the formulation of the velocities vector and accelerations vector is presented and analyzed here. These two sets of vectors are defined in terms of translational and rotational coordinates.

An evolutionary approach to the use of Petri net based models: from parallel controllers to HW/SW co-design

"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICATPN’1998"