Computer Science – Cryptography and Security
Scientific paper
2009-05-19
Computer Science
Cryptography and Security
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
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.
Profile ID: LFWR-SCP-O-700164