RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2002 Volume 293, Pages 39–58 (Mi znsl1675)

This article is cited in 3 papers

On non-abelian homomorphic public-key cryptosystems

D. Yu. Grigor'eva, I. N. Ponomarenkob

a Institute of Mathematical Research of Rennes
b St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences

Abstract: We construct homomorphic cryptosystems being (secret) epimorphisms $f\colon G\to H$, where $G$, $H$ are (publically known) groups and $H$ is finite. A letter of a message to be encrypted is an element $h\in H$, while its encryption $g\in G$ is such that $f(g)=h$. A homomorphic cryptosystem allows one to perform computations (operating in a group $G$) with encrypted information (without knowing the original message over $H$).
In this paper certain homomorphic cryptosystems are constructed for the first time for non-abelian groups $H$ (earlier, homomorphic cryptosystems were known only in the Abelian case). In fact, we present such a system for any solvable (fixed) group $H$.

UDC: 512.510

Received: 07.12.2002


 English version:
Journal of Mathematical Sciences (New York), 2005, 126:3, 1158–1166

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024