Thread: Better error correction View Single Post
 2020-11-01, 19:33 #1 R. Gerbicz     "Robert Gerbicz" Oct 2005 Hungary 2×32×5×17 Posts Better error correction With a probably restarted computation the task is to compute base^(2^n) mod N, so here we can have that base is "big". As usual the standard setup, let: x[t]=base^(2^(t*L)) mod N y[t]=x[0]*x[1]*..*x[t] mod N then: we compute the y[] sequence with y[t]=y[t-1]*x[t] the error check: y[t]=base*y[t-1]^(2^L) mod N should hold. If we have a detected error for t=m, but we have stored in memory (x[t],y[t-1],y[t]) earlier residues for 0