Hidden Polynomial(s) Cryptosystems

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

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

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-529352

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