{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:18:08Z","timestamp":1761664688853,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Dutch Startimpuls NAQT KAT-2"},{"name":"NGF Quantum Delta NL KAT-2"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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\u2019s result that perfect encryption requires the key to be at least as long as the entropy of the plaintext. Entropically secure encryption is possible when a lower bound is known on the entropy of the plaintext from the adversary\u2019s point of view. 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. In the classical case, we obtain a reduction of the ciphertext size.<\/jats:p>","DOI":"10.1007\/s11128-024-04330-z","type":"journal-article","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T09:02:23Z","timestamp":1711184543000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Entropically secure encryption with faster key expansion"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-6396","authenticated-orcid":false,"given":"Mehmet H\u00fcseyin","family":"Temel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"\u0160kori\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"4330_CR1","unstructured":"Vernam, G.S.: Secret signaling system. US Patent 1310719 (1918)"},{"key":"4330_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Mosca, M., Tapp, A., Wolf, R.: Private quantum channels. In: Annual Symposium on Foundations of Computer Science, pp. 547\u2013553 (2000)","DOI":"10.1109\/SFCS.2000.892142"},{"issue":"4","key":"4330_CR3","doi-asserted-by":"publisher","first-page":"042317","DOI":"10.1103\/PhysRevA.67.042317","volume":"67","author":"PO Boykin","year":"2003","unstructured":"Boykin, P.O., Roychowdhury, V.: Optimal encryption of quantum bits. Phys. Rev. A 67(4), 042317 (2003)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"4330_CR4","first-page":"14","volume":"2","author":"DW Leung","year":"2002","unstructured":"Leung, D.W.: Quantum Vernam cipher. Quantum Inf. Comput. 2(1), 14\u201334 (2002)","journal-title":"Quantum Inf. Comput."},{"key":"4330_CR5","doi-asserted-by":"crossref","unstructured":"Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 133\u2013148. Springer (2002)","DOI":"10.1007\/3-540-46035-7_9"},{"key":"4330_CR6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Entropic security and the encryption of high entropy messages. In: Theory of Cryptography Conference, pp. 556\u2013577. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_30"},{"issue":"4","key":"4330_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s11128-009-0111-3","volume":"8","author":"SP Desrosiers","year":"2009","unstructured":"Desrosiers, S.P.: Entropic security in quantum cryptography. Quantum Inf. Process. 8(4), 331\u2013345 (2009)","journal-title":"Quantum Inf. Process."},{"issue":"7","key":"4330_CR8","doi-asserted-by":"publisher","first-page":"3455","DOI":"10.1109\/TIT.2010.2048488","volume":"56","author":"SP Desrosiers","year":"2010","unstructured":"Desrosiers, S.P., Dupuis, F.: Quantum entropic security and approximate quantum encryption. IEEE Trans. Inf. Theory 56(7), 3455\u20133464 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4330_CR9","doi-asserted-by":"crossref","unstructured":"Fehr, S., Schaffner, C.: Randomness extraction via $$\\delta $$-biased masking in the presence of a quantum attacker. In: Theory of Cryptography Conference, pp. 465\u2013481. Springer (2008)","DOI":"10.1007\/978-3-540-78524-8_26"},{"issue":"01","key":"4330_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219749908003256","volume":"6","author":"R Renner","year":"2008","unstructured":"Renner, R.: Security of quantum key distribution. Int. J. Quantum Inf. 6(01), 1\u2013127 (2008)","journal-title":"Int. J. Quantum Inf."},{"key":"4330_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00220-004-1087-6","volume":"250","author":"P Hayden","year":"2004","unstructured":"Hayden, P., Leung, D., Shor, P.W., Winter, A.: Randomizing quantum states: constructions and applications. Commun. Math. Phys. 250, 371\u2013391 (2004)","journal-title":"Commun. Math. Phys."},{"key":"4330_CR12","doi-asserted-by":"crossref","unstructured":"Aubrun, G.: On almost randomizing channels with a short Kraus decomposition. Commun. Math. Phys. 1103\u20131116 (2009)","DOI":"10.1007\/s00220-008-0695-y"},{"key":"4330_CR13","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Smith, A.: Small pseudo-random families of matrices: derandomizing approximate quantum encryption. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3122, 249\u2013260 (2004)","DOI":"10.1007\/978-3-540-27821-4_23"},{"key":"4330_CR14","doi-asserted-by":"crossref","unstructured":"Dickinson, P.A., Nayak, A.: Approximate randomization of quantum states with fewer bits of key. In: AIP Conference Proceedings, vol. 864, pp. 18\u201336. American Institute of Physics (2006)","DOI":"10.1063\/1.2400876"},{"issue":"03","key":"4330_CR15","doi-asserted-by":"publisher","first-page":"1750016","DOI":"10.1142\/S0219749917500162","volume":"15","author":"B \u0160kori\u0107","year":"2017","unstructured":"\u0160kori\u0107, B., Vries, M.: Quantum key recycling with 8-state encoding (the quantum one-time pad is more interesting than we thought). Int. J. Quantum Inf. 15(03), 1750016 (2017)","journal-title":"Int. J. Quantum Inf."},{"key":"4330_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"4330_CR17","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Horodecki, M., Leung, D., Mayers, D., Oppenheim, J.: The universal composable security of quantum key distribution. In: Theory of Cryptography Conference. Springer, pp. 386\u2013406 (2005)","DOI":"10.1007\/978-3-540-30576-7_21"},{"key":"4330_CR18","doi-asserted-by":"crossref","unstructured":"Fehr, S., Schaffner, C.: Composing quantum protocols in a classical environment. In: Theory of Cryptography Conference, pp. 350\u2013367. Springer (2009)","DOI":"10.1007\/978-3-642-00457-5_21"},{"issue":"12","key":"4330_CR19","doi-asserted-by":"publisher","first-page":"122203","DOI":"10.1063\/1.4838856","volume":"54","author":"M M\u00fcller-Lennert","year":"2013","unstructured":"M\u00fcller-Lennert, M., Dupuis, F., Szehr, O., Fehr, S., Tomamichel, M.: On quantum R\u00e9nyi entropies: a new generalization and some properties. J. Math. Phys. 54(12), 122203 (2013)","journal-title":"J. Math. Phys."},{"issue":"2","key":"4330_CR20","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00220-014-2122-x","volume":"331","author":"MM Wilde","year":"2014","unstructured":"Wilde, M.M., Winter, A., Yang, D.: Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched R\u00e9nyi relative entropy. Commun. Math. Phys. 331(2), 593\u2013622 (2014)","journal-title":"Commun. Math. Phys."},{"issue":"8","key":"4330_CR21","doi-asserted-by":"publisher","first-page":"082206","DOI":"10.1063\/1.4892761","volume":"55","author":"M Tomamichel","year":"2014","unstructured":"Tomamichel, M., Berta, M., Hayashi, M.: Relating different quantum generalizations of the conditional R\u00e9nyi entropy. J. Math. Phys. 55(8), 082206 (2014)","journal-title":"J. Math. Phys."},{"key":"4330_CR22","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: FOCS, vol. 30, pp. 248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"4330_CR23","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley series in computer science and information processing. Addison-Wesley Pub. Co (1974)"},{"issue":"2","key":"4330_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0097-3165(89)90020-4","volume":"50","author":"DG Cantor","year":"1989","unstructured":"Cantor, D.G.: On arithmetical algorithms over finite fields. J. Comb. Theory Ser. A 50(2), 285\u2013300 (1989)","journal-title":"J. Comb. Theory Ser. A"},{"key":"4330_CR25","unstructured":"Mateer, T.: Fast Fourier transform algorithms with applications. Ph.D. thesis, Clemson University (2008)"},{"issue":"4","key":"4330_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2. Acta Inform. 7(4), 395\u2013398 (1977)","journal-title":"Acta Inform."},{"issue":"4","key":"4330_CR27","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s13389-018-0197-6","volume":"9","author":"G Banegas","year":"2019","unstructured":"Banegas, G., Cust\u00f3dio, R., Panario, D.: A new class of irreducible pentanomials for polynomial-based multipliers in binary fields. J. Cryptogr. Eng. 9(4), 359\u2013373 (2019)","journal-title":"J. Cryptogr. Eng."},{"key":"4330_CR28","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in gf (2)[x]. In: Algorithmic Number Theory: 8th International Symposium, ANTS-VIII Banff, Canada, May 17\u201322, 2008 Proceedings 8, pp. 153\u2013166. Springer (2008)","DOI":"10.1007\/978-3-540-79456-1_10"},{"key":"4330_CR29","unstructured":"Seroussi, G.: Table of Low-weight Binary Irreducible Polynomials. Hewlett-Packard Laboratories (1998)"},{"issue":"5","key":"4330_CR30","doi-asserted-by":"publisher","first-page":"054307","DOI":"10.1103\/PhysRevA.79.054307","volume":"79","author":"Q Li","year":"2009","unstructured":"Li, Q., Chan, W.H., Long, D.-Y.: Arbitrated quantum signature scheme using bell states. Phys. Rev. A 79(5), 054307 (2009)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04330-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04330-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T22:46:15Z","timestamp":1731624375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04330-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":30,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["4330"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04330-z","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2024,3,23]]},"assertion":[{"value":"30 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"119"}}