Let Ai(L), Ai(L*) denote the successive minima of a lattice L and its reciprocal lattice L*, and let [b l , . . . , bn] be a basis of L that is reduced in the sense of Korkin and Zolotarev. We prove that [4/(/+ 3)]),i(L) 2 _< [bi[ 2 < [(i + 3)/4])~i(L) 2 and Ibil2An_i+l(L*) 2 <_ [(i + 3)/4][(n i + 4)/417~ 2, where "y~ =min(Tj : 1 < j _< n} and 7j denotes Hermite's constant. As a consequence the...

In the present work, an integrated method of pole shape design optimization for reduction of torque pulsation components in permanent magnet synchronous motors is developed. A progressive design process is presented to find feasible optimal shapes. This method is applied on the pole shape optimization of two prototype permanent magnet synchronous motors, i.e., 4-poles/6-slots and 4-poles-12slots.

In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi–Monte Carlo node sets. The classical measure for such parameter searches is the spectral test which is based on a calculation of the shortest nonzero vector in a lattice. Instead of the shortest vector we apply an approximation given by the LLL algorithm for lattice basis reduction. We empirically ...

Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms attacks. With symmetric encryption, both parties encrypt decrypt messages using same key. on digital signature (ECDSA) involve forming a basis setting target vector from signatures, then solving close...

Lattice Definition. (Lattice) Given n linearly independent vectors b1, , bn ∈ R, the lattice generated by them · · · is defined as L(b1, b2, · · · bn) = { xibi|xi ∈ Z}. We refer to b1, · · · , bn as a basis of the lattice. Equivalently, if we define B as the m × n matrix whose columns are b1, , bn, then the lattice generated by B is · · · L(B) = L(b1, b2, · · · , bn) = {Bx|x ∈ Z}. We say that t...

We introduce a reduced basis approach as a new paradigm for modeling, representing and searching for gravitational waves. We construct waveform catalogs for nonspinning compact binary coalescences, and we find that for accuracies of 99% and 99.999% the method generates a factor of about 10-10(5) fewer templates than standard placement methods. The continuum of gravitational waves can be represe...

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high dimensional Finite Element space into a low dimensional space with comparably good approximation properties and a remainder space with negligible information. ...

The LLL algorithm, named after its inventors, Lenstra, Lenstra and Lovász, is one of themost popular lattice reduction algorithms in the literature. In this paper, we propose the first variant of LLL algorithm that is dedicated for ideal lattices, namely, the iLLL algorithm. Our iLLL algorithm takes advantage of the fact that within LLL procedures, previously reduced vectors can be re-used for ...