Probabilistic algorithms for sparse polynomials. In: Symbolic and algebraic computation (EUROSAM’79), Internat. Sympos., Springer Verlag, Lecture Notes in Computer Science, vol 72, pp 216– A Example of Key Recovery in Characteristic 2 A.1 Example for Even (1979)

by R Zippel
Venue:d = 6, D = (q + 1) = 3, r = N ⌈log q (d)⌉ = 2. The private key is given in Fig. 3 and the public key in Fig. 4. F1 = θ 30 X 3 1 + θ 33 X 2 1 . ⎛ ⎞ ⎛ ⎞ S = ,T