The discrete logarithm problem in the group of non-singular circulant matrices

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The discrete logarithm problem is one of the backbones in public key
cryptography. In this paper we study the discrete logarithm problem in the
group of circulant matrices over a finite field. This gives rise to secure and
fast public key cryptosystems.

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

The discrete logarithm problem in the group of non-singular circulant matrices 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 The discrete logarithm problem in the group of non-singular circulant matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The discrete logarithm problem in the group of non-singular circulant matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-700164

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