arXiv 2201.001882022-01quant-ph

具有更快密钥扩展的熵安全加密

Entropically secure encryption with faster key expansion

Mehmet Huseyin Temel, Boris Skoric

DOI：: 10.1007/s11128-024-04330-z

阅读 PDF

arXiv 页面 ↗HTML 原文 ↗

AI总结：

本文提出一种用于熵安全加密的更快密钥扩展新方法，在经典和量子设定下均实现与现有方法相同的安全性，并在密钥长度占消息长度较大比例时显著提升速度，于量子态近似随机化时获得2倍因子提升。

摘要：

熵安全加密是一种用小密钥加密大明文并仍具有信息论安全性的方法，从而在某种意义上绕过了Shannon关于完美加密要求密钥长度至少与明文熵一样长的结论。熵安全加密并非完美的，它仅在已知明文熵的下界时才有效。典型的实现方式是将短密钥扩展到明文大小，例如通过乘以一个公共随机串，然后使用一次性密码本加密。这在经典和量子设定下均适用。在本文中，我们引入了一种比现有方法更快的密钥扩展新方法。我们证明了它实现了相同的安全性。当密钥长度是消息长度的相当一部分时，速度提升最为显著。特别是在量子态近似随机化的情况下，获得了2倍的因子提升。

英文摘要：

Entropically secure encryption is a way to encrypt a large plaintext with a small key and still have information-theoretic security, thus in a certain sense circumventing Shannon's result that perfect encryption requires the key to be at least as long as the entropy of the plaintext. Entropically secure encryption is not perfect, and it works only if a lower bound is known on the entropy of the plaintext. The typical implementation is to expand the short key to the size of the plaintext, e.g. by multiplication with a public random string, and then use one-time pad encryption. This works in the classical as well as the quantum setting. In this paper, we introduce a new key expansion method that is faster than existing ones. We prove that it achieves the same security. The speed gain is most notable when the key length is a sizeable fraction of the message length. In particular, a factor of 2 is gained in the case of approximate randomization of quantum states.

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

AI总结：

摘要：

英文摘要：

相关论文