We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is ba...
Andrius Raulynaitis, Eligijus Sakalauskas, Saulius...
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...