Perfect Secrecy Using Compressed Sensing

Details Perfect Secrecy Using Compressed Sensing Perfect Secrecy Using Compressed Sensing

2010-11-17

arxiv.org/abs/1011.3985v1

Computer Science

Information Theory

3 pages

Scientific paper

In this paper we consider the compressed sensing-based encryption and proposed the conditions in which the perfect secrecy is obtained. We prove when the Restricted Isometery Property (RIP) is hold and the number of measurements is more than two times of sparsity level i.e. M \geq 2k, the perfect secrecy condition introduced by Shannon is achievable if message block is not equal to zero or we have infinite block length

Affiliated with

Also associated with

No associations

Rating

Perfect Secrecy Using Compressed Sensing 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 Perfect Secrecy Using Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect Secrecy Using Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112758