ECC decryption experiment result by invalid point attack
  160-bit ECC

========================================================
Test NO.1 (ECC-160)

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=1332297598440044874827085558802491743757193798159
 r=1332297598440044874827086028738397018119062378535
 a=297190522446607939568481567949428902921613329152
 b=1332297598440044874827085558802491743757183264023
 Qx=190328228348577839261012222686070249108170542586
 Qy=245446296651976619653479326134846272096395013121
 Rx=64258149674179999915104254019219549782846798797
 Ry=566827240790588299745051511549412674793916275755
----- Solving information -------------
 Search pointer size=8388608
 r=5 sol=3 loop=1
 r=9791 sol=8167 loop=120
 r=69431 sol=8111 loop=566
 r=300967 sol=119712 loop=315
 r=332251 sol=268473 loop=308
 r=954719 sol=937447 loop=2199
 r=1732343 sol=837956 loop=256
 r=28706087 sol=27680719 loop=3634
 r=82562369 sol=21763287 loop=15171
----- Decoding result n for R=n*Q --------
solve n=361399714182425030682809447642581859737484131308
 solve total loop=22570
 used time=0.92 sec

========================================================
Test NO.2 (ECC-160)

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=1332297598440044874827085558802491743757193798159
 r=1332297598440044874827086028738397018119062378535
 a=297190522446607939568481567949428902921613329152
 b=1332297598440044874827085558802491743757183264023
 Qx=190328228348577839261012222686070249108170542586
 Qy=245446296651976619653479326134846272096395013121
 Rx=369994557097102864423209442552632156565645010
 Ry=857913293728929211200389076957478034200039739556
----- Solving information -------------
 Search pointer size=8388608
 r=5 sol=1 loop=3
 r=9791 sol=448 loop=159
 r=69431 sol=61368 loop=105
 r=300967 sol=183580 loop=679
 r=332251 sol=154408 loop=750
 r=954719 sol=24799 loop=436
 r=1732343 sol=246234 loop=712
 r=28706087 sol=9626985 loop=5003
 r=82562369 sol=11691455 loop=10733
----- Decoding result n for R=n*Q --------
solve n=1066218242851784022274636322085686056905166345931
 solve total loop=18580
 used time=0.81 sec

========================================================
Test NO.3 (ECC-160)

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=1332297598440044874827085558802491743757193798159
 r=1332297598440044874827086028738397018119062378535
 a=297190522446607939568481567949428902921613329152
 b=1332297598440044874827085558802491743757183264023
 Qx=190328228348577839261012222686070249108170542586
 Qy=245446296651976619653479326134846272096395013121
 Rx=965185153465359872971524581085279805039603554733
 Ry=746642413762190354085151814889573570144000689491
----- Solving information -------------
 Search pointer size=8388608
 r=5 sol=1 loop=3
 r=9791 sol=6986 loop=115
 r=69431 sol=61286 loop=381
 r=300967 sol=28971 loop=326
 r=332251 sol=205354 loop=919
 r=954719 sol=526856 loop=912
 r=1732343 sol=831718 loop=1150
 r=28706087 sol=25071099 loop=3272
 r=82562369 sol=34341702 loop=7705
----- Decoding result n for R=n*Q --------
solve n=776185137636997812074175759739280911510096679846
 solve total loop=14783
 used time=0.61 sec