|Table of Contents|

Efficient Scalar Representation in kP of Elliptic Curve Cryptosystems(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2010年03期
Page:
135-140
Research Field:
计算机科学
Publishing date:

Info

Title:
Efficient Scalar Representation in kP of Elliptic Curve Cryptosystems
Author(s):
Li Zhong1; 2; Peng Daiyuan1
1.School of Information Science & Technology,Southwest Jiaotong University,Chengdu 610031,China 2. School of Com puter& In form ation Eng ineering, Y ib inU n iversity, Y ib in 644000, Ch ina
Keywords:
elliptic curve cryptosy sytem;  sca larm ultip lication;  scalar representation;  hamm ing w eigh t
PACS:
TN918.1
DOI:
-
Abstract:
Sca lar mu ltiplica tion is the fundamenta l and tim e-consum ing ope ra tion in e lliptic curve cryptosystem s, the perform ance of the e lliptic curve cryptosysytem deeply depends on the effic iency o f sca larm ultip lication. In sca la rm ultip l-i ca tion, the sca la r ks representa tion p lays an im portant ro le, it‘ s length dec ide the number of po int addition ope rations, it’ s hamm ingw e ight dec ide the number o f po int double operations. In this paper, a new sca lar representation m ethod w as presented, it can reduce the hamm ing we ight effic iently. The ana ly sis results show that the new m ethod is m ore effic ient than ex isting sca lar representation m ethods, and is particu lar ly use fu l for the sca la r such as { 10} m and { 10} m ‖ 1.

References:

[ 1]Lopez J, Dahab R. An ove rv iew o f e lliptic curv e cryp tog raphy[ R]. Brazi:l Institute o f Com puting, Sta teUniversity o f Com b-i nas, 2000.
[ 2]A -l Som an iT, Ibrahim M. H igh pe rfo rm ance e lliptic curv eGF( 2m ) c ryptoprocesso r secure ag ainst tim ing attacks[ J] . Internationa l Journa l of Com puter Sc ience and N etw ork Secur ity ( IJCSNS) , 2006, 6( 1B): 177-183.
[ 3]Booth A D. A signed b inarym ultip lication techn ique[ J]. Journal o fAppliedM athema tics, 1951, 4( 2): 236-240.
[ 4]Re itw iesnerG W. B inary ar ithm e tic[ C] / / Advances in Compu ters. New Yo rk: Academ ic Press, 1960( 1): 231-308.
[ 5]M o ra in F, O livos J. Speed ing up the compu tations on an e lliptic curv e using add ition- subtraction cha ins[ J]. RAIRO Theore tica l Inform a tics and App lications, 1990, 24( 6): 531-543.
[ 6]H ankerson D, M enezes A, Vanstone S. Guide to E lliptic Curve C ryptography [M ]. New York: Springer-Verlag, 2004.
[ 7]IEEE P1363-2000. Standard Specifications fo r Pub lic-Key Cryp tog raphy[ S]. New Yo rk: IEEE Standard Asso ciations, 2000
[ 8]Okey aK. Signed b inary represen tations rev is ited[ C] / / FranklinM. Advances in C rypto logy-CRYPTO 2004, Vo lum e 3152 o f LNCS. New York: Spr inge r-Ver lag, 2004: 123-139.
[ 9]Ba lasub ram aniam P, Karth ikeyan E. E lliptic curve scalar m ultiplication a lgo rithm using comp lementary recod ing [ J]. App liedM a them atics and Computation, 2007, 190: 51-56.
[ 10]So linas J A. E fficien t arithm etic on Koblitz curves[ J]. Des igns, Codes and C ryptography, 2000, 19( 2 /3): 195-249
[ 11]Av an iR M. A no te on the sliding w indow integer recod ing and its le ft- to-r ight analogue[ C] / / Proceed ing s o f SAC 2004. W ater loo: Un iversity o fW aterloo, 2004.

Memo

Memo:
-
Last Update: 2013-04-08