Homomorphic public-key cryptosystems over groups and rings

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-47579

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.