pith. sign in

arxiv: cs/0309010 · v1 · submitted 2003-09-08 · 💻 cs.CR

Homomorphic public-key cryptosystems over groups and rings

classification 💻 cs.CR
keywords homomorphiccryptosystemfinitegroupspublic-keyringsarbitrarybesides
0
0 comments X
read the original abstract

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. Besides, a homomorphic cryptosystem is designed for the first time over finite commutative rings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.