D. Grigoriev

activity

20022004

most citedPolynomial-time computing over quadratic maps I: sampling in real algebraic sets

31 citations · 42 across the 6 of their papers we have counts for

collaborators

Showing 2003Show all

3 papers · 1 filter

cs.SC2003

Weak Bezout inequality for D-modules

Dima Grigoriev

Let ${w_{i, j}}_{1 \leq i \leq n, 1 \leq j \leq s} \subset L_{m} = F (X_{1}, ..., X_{m}) [\frac{\partial}{\partial X _{1}}, ..., \frac{\partial}{\partial X _{m}}]$ be linear partial differential operato…

cs.CR2003★ 4 cited

Homomorphic public-key cryptosystems over groups and rings

Dima Grigoriev, Ilia Ponomarenko

We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membership problem for groups of integer matrices. Besid…

cs.CR2003★ 1 cited

Homomorphic public-key cryptosystems and encrypting boolean circuits

Dima Grigoriev, Ilia Ponomarenko

In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarith…