A computationally-efficient construction for the matrix-based key distribution in sensor network

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages

Scientific paper

This paper introduces a variant for the symmetric matrix-based key distribution in sensor network introduced by Du et al. Our slight modification shows that the usage of specific structures for the public matrix instead of fully random matrix with elements in $\mathbb{Z}_q$ can reduce the computation overhead for generating the public key information and the key itself. An intensive analysis followed by modified scheme demonstrates the value of our contribution in relation with the current work and show the equivalence of the security

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

A computationally-efficient construction for the matrix-based key distribution in sensor network 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 A computationally-efficient construction for the matrix-based key distribution in sensor network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A computationally-efficient construction for the matrix-based key distribution in sensor network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-395751

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