On non-abelian homomorphic public-key cryptosystems
| dc.creator | Grigoriev, D. | |
| dc.creator | Ponomarenko, I. | |
| dc.date | 2002-07-23 | |
| dc.date | 2002-11-14 | |
| dc.date.accessioned | 2026-07-07T03:18:43Z | |
| dc.date.available | 2026-07-07T03:18:43Z | |
| dc.description | An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G --> H, where G, H are (publically known) groups and H is finite. A letter of a message to be encrypted is an element h element of H, while its encryption g element of 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. | |
| dc.description | 15 pages, LaTeX | |
| dc.identifier | https://arxiv.org/abs/cs/0207079 | |
| dc.identifier | http://arxiv.org/abs/cs/0207079 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31228 | |
| dc.subject | Cryptography and Security | |
| dc.subject | E.3 | |
| dc.title | On non-abelian homomorphic public-key cryptosystems | |
| dc.type | text |