arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.3985cs.ITcs.CRmath.IT
收藏

基于压缩感知的完美保密

Perfect Secrecy Using Compressed Sensing

Mahmoud Ramezani Mayiami, Babak Seyfe, Hamid G. Bafghi

摘要:

本文研究了基于压缩感知的加密,给出了完全保密性的条件。我们证明了在满足限制等距性(RIP)且测量次数大于2倍稀疏度即M \geq 2k的情况下,如果消息块不等于零或具有无限长的块长度,则Shannon提出的完美保密条件是可实现的

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑