Editing
Homomorphic Public-Key Cryptosystems over Groups and Rings
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: Homomorphic Public-Key Cryptosystems over Groups and Rings Abstract: This research proposes a new homomorphic public-key cryptosystem for non-identity finite groups and rings, based on the difficulty of the membership problem for groups of integer matrices. The study introduces a homomorphic cryptosystem for the first time over finite commutative rings. The main result is a homomorphic public-key cryptosystem over arbitrary non-identity finite groups, based on the difficulty of the membership problem for groups of integer matrices. This work suggests that the infinity of the group is not a barrier for performing encryption and decryption algorithms, and introduces a new approach to secret computations in cryptography. Link to Article: https://arxiv.org/abs/0309010v1 Authors: arXiv ID: 0309010v1 [[Category:Computer Science]] [[Category:Groups]] [[Category:Homomorphic]] [[Category:Public]] [[Category:Key]] [[Category:Over]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information