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

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=76884956397045344220809746629001649093037950200943055203735601445031516197751
 r=76884956397045344220809746629001649093290753930282523950888247819578392967598
 a=56698187605326110043627228396178346077120614539475214109386828188763884139993
 b=1000077
 Qx=10983565199577906317258535232714521299005421457277579314819371635004502313955
 Qy=25038490224467383561548593182327533121174628253617209462020969217704594379357
 Rx=5064819534421599272940629151403998978908100023459407501688194193950421797439
 Ry=5161901585312439442303678383847638391349616914702926736540146213546593718917
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=0 loop=2
 r=19 sol=17 loop=7
 r=5743 sol=4622 loop=49
 r=40586312779 sol=14622756604 loop=180597
 r=58733831549 sol=29926735762 loop=305480
 r=121017846067 sol=117570917146 loop=409487
 r=1582983270989 sol=1459129833192 loop=3073266
 r=5569530239657 sol=1386762678208 loop=2057700
 r=138518161225427 sol=118084973738550 loop=4878470
----- Decoding result n for R=n*Q --------
solve n=65493292897724034441287121562703550552049099946235797857592401301846436831142
 solve total loop=10905058
 used time=637.95 sec

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=76884956397045344220809746629001649093037950200943055203735601445031516197751
 r=76884956397045344220809746629001649093290753930282523950888247819578392967598
 a=56698187605326110043627228396178346077120614539475214109386828188763884139993
 b=1000077
 Qx=10983565199577906317258535232714521299005421457277579314819371635004502313955
 Qy=25038490224467383561548593182327533121174628253617209462020969217704594379357
 Rx=35679217253448170599243657272983425170392687636546314280785714741485117497612
 Ry=41764097845538627795784812112152544244350556693724612981089490960597503108086
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=1 loop=1
 r=19 sol=3 loop=2
 r=5743 sol=2133 loop=53
 r=40586312779 sol=32800382570 loop=295903
 r=58733831549 sol=43351967340 loop=459276
 r=121017846067 sol=36858835201 loop=729955
 r=1582983270989 sol=209906790314 loop=719424
 r=5569530239657 sol=1344216677108 loop=2932666
 r=138518161225427 sol=58041175413893 loop=13435283
----- Decoding result n for R=n*Q --------
solve n=41522133791875760556135653116599631843445631762916484097392074068326184063839
 solve total loop=18572563
 used time=1069.19 sec

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

Rho method to solve n from R=n*Q by python
----- Input information ---------------
 p=76884956397045344220809746629001649093037950200943055203735601445031516197751
 r=76884956397045344220809746629001649093290753930282523950888247819578392967598
 a=56698187605326110043627228396178346077120614539475214109386828188763884139993
 b=1000077
 Qx=10983565199577906317258535232714521299005421457277579314819371635004502313955
 Qy=25038490224467383561548593182327533121174628253617209462020969217704594379357
 Rx=32681579111465751768504171108764138847897320221800935062500639149395746284817
 Ry=42648754251188477150586491590267579355072549307073995788569630340518041418370
----- Solving information -------------
 Search pointer size=8388608
 r=2 sol=1 loop=1
 r=19 sol=10 loop=8
 r=5743 sol=1487 loop=105
 r=40586312779 sol=33535518416 loop=89576
 r=58733831549 sol=26590667092 loop=469650
 r=121017846067 sol=88683409125 loop=145577
 r=1582983270989 sol=251336342281 loop=943453
 r=5569530239657 sol=526111398141 loop=1378930
 r=138518161225427 sol=15007823019861 loop=21691302
----- Decoding result n for R=n*Q --------
solve n=4990581910902885722572125341044861216212631665840555223145081886145938919083
 solve total loop=24718602
 used time=1436.10 sec