نتایج جستجو برای: الگوریتم lll
تعداد نتایج: 23323 فیلتر نتایج به سال:
Gold(Ill) is isoelectronic (5d8) and often isostructuml (square-planar) with Pt(ll) and might form the basis of active anticancer agents [1]. However little is known about the biochemistry of Au(lll), a subject also of interest in connection with the side-effects of antiarthritic gold drugs [2]. In this work we have explored the binding of [Au(lll)(diethylenetriamine)CI]CI2 to tripeptides over ...
The algorithmic facet of euclidean lattices is a frequent tool in computer science and mathematics. It mainly relies on the LLL reduction, making worthwile efficiency improvements. Schnorr proved that the LLL algorithm can be speeded up if one computes approximations to the underlying Gram-Schmidt orthogonalisations. Without approximations, these computations dominate the cost of the reduction....
When determining lower limb loading (LLL) sources of error include the vibration of kinematic marker plates and how the motion and force data are digitally filtered. This study examined LLL during dynamic actions with reduced marker vibration using a tibial plate (TP) and two different levels of filtering severity (15 Hz and 35 Hz cut-offs). The increase of the filter cut-off frequency for the ...
Coppersmith described at Eurocrypt 96 a polynomial-time algorithm for finding small roots of univariate modular equations, based on lattice reduction. In this paper we describe the first improvement of the asymptotic complexity of Coppersmith’s algorithm. Our method consists in taking advantage of Coppersmith’s matrix structure, in order to apply LLL algorithm on a matrix whose elements are sma...
Quantum electrodynamics (QED) in a strong constant magnetic field is investigated from the viewpoint of its connection with noncommutative QED. It turns out that within the lowest Landau level (LLL) approximation the 1-loop contribution of fermions provides an effective action with the noncommutative U(1)NC gauge symmetry. As a result, the Ward-Takahashi identities connected with the initial U(...
In the paper, there were analyzed six popular teaching methods – case method, enquiry-based learning, spiral learning, problem-based learning, project-organized learning, and b-learning – for the purpose of selecting and providing relevant teaching methods for LLL courses. There were evaluated the usefulness of each teaching method for LLL courses and identified their relevance for life-long le...
—The LLL algorithm is strong algorithm that de-crypts the additional type Knapsack cryptosystem. However, the LLL algorithm is not applicable in the addition in the group that rational points of elliptic curves on finite fields do. Therefore, we think the Knapsack cryptosystem constructed on elliptic curves. By using the pairing for the decryption, it is shown to be able to make the computation...
In this paper, V candidate symbols are considered at the first layer, then V probable streams are detected with complex LLL because of the complexity. Finally, the most probable stream is selected through a ML test. By using complex LLL, the proposed scheme can achieve more low complexity than QRD-M. Simulation results show that the proposed scheme provides similar performance as the QRD-M.
Last time we defined the minimum distance λ1(L) of a lattice L, and showed that it is upper bounded by √ n · det(L)1/n (Minkowski’s theorem), but this bound is often very loose. Some natural computational questions are: given a lattice (specified by some arbitrary basis), can we compute its minimum distance? Can we find a vector that achieves this distance? Can we find good approximations to th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید