We applied the maximum offset of sound velocity algorithm to sound velocity profile streamlining and optimization to overcome multibeam survey and data-processing efficiency problems. The impact of sound velocity prof...
详细信息
We applied the maximum offset of sound velocity algorithm to sound velocity profile streamlining and optimization to overcome multibeam survey and data-processing efficiency problems. The impact of sound velocity profile streamlining on sounding data accuracy is evaluated. By automatically optimizing the threshold, the reduction rate of sound velocity profile data can reach over 90% and the standard deviation percentage error of sounding data can be controlled to within 0.1%. The optimized sound velocity profile data improved the operational efficiency of the multi-beam survey and data postprocessing by 3.4times, indicating that this algorithm has practical value for engineering applications.
In recent years, the study of the security of Elliptic Curve Cryptosystems (ECCs) have been received much at attention. The mov algorithm, which reduces the elliptic curve discrete log problem (ECDLP) to the discrete ...
详细信息
In recent years, the study of the security of Elliptic Curve Cryptosystems (ECCs) have been received much at attention. The mov algorithm, which reduces the elliptic curve discrete log problem (ECDLP) to the discrete log problem in finite fields with the Well pairing, is a representative attack on ECCs. Recently Kanayama et ai. observed a realization of the mov algorithm for non-supersingular elliptic curves under the weakest condition. Shikata et al. independently considered a realization of the mov algorithm for non-supersingular elliptic curves and proposed a generalization of the mov algorithm. This short note explicitly shows that, under a usual cryptographical condition, me can apply the mov algorithm to non-supersingular elliptic curves by using the multiplication by constant maps as in the case of supersingular. Namely, it is explicitly showed that we don't need such a generalization in order to realize the mov algorithm for non-supersingular elliptic curves under a usual cryptographical condition.
The mov and FR algorithms, which are representative attacks on elliptic curve cryptosystems, reduce the elliptic curve discrete logarithm problem (ECDLP) to the discrete logarithm problem in a finite field. This paper...
详细信息
The mov and FR algorithms, which are representative attacks on elliptic curve cryptosystems, reduce the elliptic curve discrete logarithm problem (ECDLP) to the discrete logarithm problem in a finite field. This paper studies these algorithms and introduces the following three results. First, we show an explicit condition under which the mov algorithm can be applied to non-supersingular elliptic curves. Next, by comparing the effectiveness of the mov algorithm to that of the FR algorithm, it is explicitly shown that the condition needed for the mov algorithm to be subexponential is the same as that for the FR algorithm except for elliptic curves of trace two. Finally, a new explicit reduction algorithm is proposed for the ECDLP over elliptic curves of trace two. This algorithm differs from a simple realization of the FR algorithm. Furthermore, pie show, by experimental results, that the running time of the proposed algorithm is shorter than that of the original FR algorithm.
暂无评论