Reliability of Schoof algorithm and its computational complexity

被引：0

作者：

Kinakh, Iaroslav ^{[1
]}

Iakymenko, Ihor ^{[1
]}

机构：

[1] Ternopil Natl Econ Univ, UA-46001 Lvov, Ukraine

来源：

EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS | 2009年

关键词：

Computer networks; Elliptic curve; encryption;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper deals with the elliptic curve encryption algorithm. Its safety is analyzed using the Schoof method. The algorithm work results allow to define a define a secret key in a simple way.

引用

页码：107 / 107

页数：1

共 50 条

[21] Computational complexity of the exterior point simplex algorithm
Voulgaropoulou, Sophia
Samaras, Nikolaos
Sifaleras, Angelo
[J]. OPERATIONAL RESEARCH, 2019, 19 (02) : 297 - 316
[22] Computational complexity of fractal image compression algorithm
Gupta, Richa
Mehrotra, Deepti
Tyagi, Rajesh Kumar
[J]. IET IMAGE PROCESSING, 2020, 14 (17) : 4425 - 4434
[23] A COMPUTATIONAL ALGORITHM FOR RELIABILITY BOUNDS IN PROBABILISTIC DESIGN
PARK, JW
CLARK, GM
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1986, 35 (01) : 30 - 31
[24] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
He, SL
Xu, CX
[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 44 (03): : 338 - 344
[25] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
何尚录
徐成贤
[J]. Science China Mathematics, 2001, (03) : 338 - 344
[26] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
Shanglu He
Chengxian Xu
[J]. Science in China Series A: Mathematics, 2001, 44 : 338 - 344
[27] ON THE COMPUTATIONAL-COMPLEXITY OF RELIABILITY REDUNDANCY ALLOCATION IN A SERIES SYSTEM
CHERN, MS
[J]. OPERATIONS RESEARCH LETTERS, 1992, 11 (05) : 309 - 315
[28] COMPUTATIONAL-COMPLEXITY OF NETWORK RELIABILITY-ANALYSIS - AN OVERVIEW
BALL, MO
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1986, 35 (03) : 230 - 239
[29] Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
Iriyama, Satoshi
Ohya, Masanori
[J]. OPEN SYSTEMS & INFORMATION DYNAMICS, 2008, 15 (02): : 173 - 187
[30] Efficient implementation of Schoof's algorithm in case of characteristic 2
Izu, T
Kogure, J
Yokoyama, K
[J]. PUBLIC KEY CRYTOGRAPHY, 2000, 1751 : 210 - 222

← 1 2 3 4 5 →