椭圆曲线标量乘高效方案设计OA

Due to the limited resources of the wireless sensor network,the elliptic curve cryptographic algorithm requires a large amount of computation,which seriously affects the life cycle of the network.It is necessary to make lightweight improvements to the algorithm to reduce resource consumption.Scalar multiplication is the key to the execution efficiency of elliptic curve crypto-graphic algorithms.By analyzing the storage and processing characteristics of wireless sensor nodes,we improve the underlying domain operations firstly,and propose the 3-Karatsuba block-combined multiplication algorithm,fast modular reduction algo-rithm,modular square and modular inverse algorithm on binary domain,which can reduce the times of basic operations and mem-ory read and write.Finally,we design a fast implementation scheme of scalar multiplication on GF(2m)based on the Montgom-ery algorithm.The results of experiments on 8 bit AVR microprocessor demonstrate that,completing an ECC point multiplication operation on the GF(2163)domain requires a total of 5 160 991 clock cycles,with a time consumption of approximately0.70 sec-onds,our contribution can improve ECC scalar multiplication significantly.