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

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=22721622932454352787552537995910928073340732145944992304435472941311
 r=22721622932454352787552537995910936165359138602815198323628342561298
 a=11020725272625742361946480833014344015343456918668456061589001510723
 b=3000000011877
 Qx=3245946133207764683936076856558704010477247449420713186347924705896
 Qy=7375748537146181172427325719208004344067486247792126018778137306451
 Rx=3751522717371228684308202225186873083975520181815830494985833618358
 Ry=4170604738243890688748484938581079030714474738234539204068416474278
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=1 loop=1
 r=9 sol=5 loop=5
 r=503 sol=501 loop=4
 r=35869 sol=9659 loop=441
 r=3018667 sol=2086839 loop=3452
 r=4886142757 sol=4071668667 loop=74786
 r=8812513327 sol=716145409 loop=89698
 r=30048533891 sol=17160559655 loop=285408
 r=79065245177 sol=42513238273 loop=263507
 r=226563285953 sol=112419094624 loop=508165
----- Decoding result n for R=n*Q --------
solve n=3901289145920221525555945030472403938471928654826569854876830639781
 solve total loop=1225467
 used time=60.89 sec

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=22721622932454352787552537995910928073340732145944992304435472941311
 r=22721622932454352787552537995910936165359138602815198323628342561298
 a=11020725272625742361946480833014344015343456918668456061589001510723
 b=3000000011877
 Qx=3245946133207764683936076856558704010477247449420713186347924705896
 Qy=7375748537146181172427325719208004344067486247792126018778137306451
 Rx=9236349463068363809660486612816817238146494928840475883797891868360
 Ry=8744702138014986553404192381110478821303288129599121420141141146005
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=1 loop=1
 r=9 sol=3 loop=3
 r=503 sol=4 loop=28
 r=35869 sol=29863 loop=184
 r=3018667 sol=634021 loop=893
 r=4886142757 sol=2999032279 loop=222580
 r=8812513327 sol=7510459426 loop=124030
 r=30048533891 sol=17840339990 loop=95250
 r=79065245177 sol=47960265491 loop=518101
 r=226563285953 sol=38061347483 loop=455407
----- Decoding result n for R=n*Q --------
solve n=8165344826316271460426571452207866420851755079077125479514374824709
 solve total loop=1416477
 used time=70.54 sec

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=22721622932454352787552537995910928073340732145944992304435472941311
 r=22721622932454352787552537995910936165359138602815198323628342561298
 a=11020725272625742361946480833014344015343456918668456061589001510723
 b=3000000011877
 Qx=3245946133207764683936076856558704010477247449420713186347924705896
 Qy=7375748537146181172427325719208004344067486247792126018778137306451
 Rx=9010817218100303796746152450710688324030693991690075071686783889328
 Ry=10927140237926874335057480080723891851122215751447812100016908003768
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=0 loop=2
 r=9 sol=0 loop=9
 r=503 sol=49 loop=23
 r=35869 sol=13751 loop=249
 r=3018667 sol=204734 loop=1294
 r=4886142757 sol=1180411704 loop=50015
 r=8812513327 sol=3645798458 loop=23869
 r=30048533891 sol=26520572845 loop=160611
 r=79065245177 sol=76907796956 loop=480380
 r=226563285953 sol=157727288031 loop=709442
----- Decoding result n for R=n*Q --------
solve n=2777249329720593207103439037073221953046894167883399312204521221218
 solve total loop=1425894
 used time=72.06 sec