88 search results - page 8 / 18 » Subquadratic-time factoring of polynomials over finite field... |
ALGORITHMICA
1999
14 years 9 months ago
1999
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
IJNSEC
2010
14 years 4 months ago
2010
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
SODA
1992
ACM
14 years 10 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
IJNSEC
2010
14 years 4 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...