Computer Science – Cryptography and Security
Scientific paper
2003-09-08
Computer Science
Cryptography and Security
Scientific paper
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.
Grigoriev Dima
Ponomarenko Ilia
No associations
LandOfFree
Homomorphic public-key cryptosystems over groups and rings 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 Homomorphic public-key cryptosystems over groups and rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homomorphic public-key cryptosystems over groups and rings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-47579