GF(3<sup>n</sup>)椭圆曲线快速算法研究<br>Research on Fast Algorithms of Elliptic Curve over GF(3<sup>n</sup>)

2012 ◽  
Vol 02 (01) ◽  
pp. 26-31
Author(s):  
刘 景景
Keyword(s):  
Elliptic Curve ◽  
Fast Algorithms

Study of Safe Elliptic Curve Cryptography over Gaussian Integer

2020 ◽  
Vol E103.A (12) ◽  
pp. 1624-1628
Author(s):  
Kazuki NAGANUMA ◽  
Takashi SUZUKI ◽  
Hiroyuki TSUJI ◽  
Tomoaki KIMURA
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Gaussian Integer

Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials

2014 ◽  
Vol E97.A (1) ◽  
pp. 300-302 ◽  
Author(s):  
Naoki KANAYAMA ◽  
Yang LIU ◽  
Eiji OKAMOTO ◽  
Kazutaka SAITO ◽  
Tadanori TERUYA ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Scalar Multiplication ◽  
Division Polynomials ◽  
Elliptic Curve Scalar Multiplication

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

Sign in / Sign up

Export Citation Format

Share Document