On non-abelian homomorphic public-key cryptosystems

Details On non-abelian homomorphic public-key cryptosystems On non-abelian homomorphic public-key cryptosystems

2002-07-23

arxiv.org/abs/cs/0207079v4

Computer Science

Cryptography and Security

15 pages, LaTeX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On non-abelian homomorphic public-key cryptosystems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On non-abelian homomorphic public-key cryptosystems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On non-abelian homomorphic public-key cryptosystems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469164