Computer Science – Cryptography and Security
Scientific paper
2003-02-26
Computer Science
Cryptography and Security
17 pages
Scientific paper
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can be replaced by a ``small'' ideal, as well. Throughout, we set up probabilistic encryption protocols, too. The same ideas extend to digital signature algorithms, as well. Our schemes work as well on differential fields of positive characteristic, and elsewhere.
No associations
LandOfFree
Hidden Polynomial(s) 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 Hidden Polynomial(s) Cryptosystems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hidden Polynomial(s) Cryptosystems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-529352