<<  >> (p.36)
    Author Topic: Pollard's kangaroo ECDLP solver  (Read 62421 times)
    Jean_Luc (OP)
    Sr. Member
    ****
    Offline Offline

    Activity: 462
    Merit: 737


    View Profile
    June 03, 2020, 08:55:17 AM
     #701

    Right.
    256 for fast access (and check) 1 dummy point is sacrificed.


    Code:
    // Compute Generator table
      Point N(G);
      for(int i = 0; i < 32; i++) {
        GTable[i * 256] = N;
        N = DoubleDirect(N);
        for (int j = 1; j < 255; j++) {
          GTable[i * 256 + j] = N;
          N = AddDirect(N, GTable[i * 256]);
        }
        GTable[i * 256 + 255] = N;/ Dummy point for check function
      }
Page 35
Viewing Page: 36