{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:33:29Z","timestamp":1777127609111,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2018\/31\/B\/ST6\/03003"],"award-info":[{"award-number":["2018\/31\/B\/ST6\/03003"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP180102199"],"award-info":[{"award-number":["DP180102199"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The bulk of Internet interactions is highly redundant and also security sensitive. To reduce communication bandwidth and provide a desired level of security, a data stream is first compressed to squeeze out redundant bits and then encrypted using authenticated encryption. This generic solution is very flexible and works well for any pair of (compression, encryption) algorithms. Its downside, however, is the fact that the two algorithms are designed independently. One would expect that designing a single algorithm that compresses and encrypts (called compcrypt) should produce benefits in terms of efficiency and security. The work investigates how to design a compcrypt algorithm using the ANS entropy coding. First, we examine basic properties of ANS and show that a plain ANS with a hidden encoding table can be broken by statistical attacks. Next, we study ANS behavior when its states are chosen at random. Our compcrypt algorithm is built using ANS with randomized state jumps and a sponge MonkeyDuplex encryption. Its security and efficiency are discussed. The design provides 128-bit security for both confidentiality and integrity\/authentication. Our implementation experiments show that our compcrypt algorithm processes symbols with a rate up to 269\u00a0MB\/s (with a slight loss of compression rate) 178 MB\/s.\n<\/jats:p>","DOI":"10.1007\/s10207-022-00597-4","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T05:04:53Z","timestamp":1657688693000},"page":"1051-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["ANS-based compression and encryption with 128-bit security"],"prefix":"10.1007","volume":"21","author":[{"given":"Seyit","family":"Camtepe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarek","family":"Duda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Mahboubi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Morawiecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surya","family":"Nepal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Paw\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1917-6466","authenticated-orcid":false,"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"597_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 32\u201349","DOI":"10.1007\/11502760_3"},{"issue":"9","key":"597_CR2","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"3","key":"597_CR3","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/18.490558","volume":"42","author":"David W Gillman","year":"1996","unstructured":"Gillman, David W., Mohtashemi, Mojdeh, Rivest, Ronald L.: On breaking a Huffman code. IEEE Trans. Inf. Theory 42(3), 972\u2013976 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"597_CR4","unstructured":"Martin, G.: Range Encoding: an Algorithm for Removing Redundancy from a Digitised Message. (1979)"},{"issue":"3","key":"597_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/290159.290162","volume":"16","author":"A Moffat","year":"1998","unstructured":"Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Trans. Inf. Syst. 16(3), 256\u2013294 (1998)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"3","key":"597_CR6","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.203.0198","volume":"20","author":"JJ Rissanen","year":"1976","unstructured":"Rissanen, J.J.: Generalized kraft inequality and arithmetic coding. IBM J. Res. Dev 20(3), 198\u2013203 (1976)","journal-title":"IBM J. Res. Dev"},{"key":"597_CR7","unstructured":"Duda, J.: Asymmetric Numeral Systems as Close to Capacity Low State Entropy Coders. CoRR, arxiv:1311.2540 (2013)"},{"key":"597_CR8","doi-asserted-by":"crossref","unstructured":"Duda, J., Tahboub, K., Gadgil, N.J., Delp, E.J.: The use of asymmetric numeral systems as an accurate replacement for Huffman coding. In: Picture Coding Symposium (PCS), Cairns, QLD, Australia, 2015, pp. 65\u201369","DOI":"10.1109\/PCS.2015.7170048"},{"issue":"4","key":"597_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397175","volume":"38","author":"A Moffat","year":"2020","unstructured":"Moffat, A., Petri, M.: Large-alphabet semi-static entropy coding via asymmetric numeral systems. ACM Trans. Inf. Syst. 38(4), 1\u201333 (2020)","journal-title":"ACM Trans. Inf. Syst."},{"key":"597_CR10","unstructured":"Kelley, J., Tamassia, R.: Secure compression: Theory & Practice. Cryptology ePrint Archive, Report 2014\/113. (2014)"},{"key":"597_CR11","unstructured":"Duda, J., Niemiec, M.: Lightweight Compression with Encryption Based on Asymmetric Numeral Systems. arxiv:1612.04662 (2016)"},{"key":"597_CR12","doi-asserted-by":"publisher","first-page":"3859","DOI":"10.1109\/TIFS.2021.3096026","volume":"16","author":"S Camtepe","year":"2021","unstructured":"Camtepe, S., Duda, J., Mahboubi, A., Morawiecki, P., Nepal, S., Paw\u0142owski, M., Pieprzyk, J.: Compcrypt - lightweight ANS-based compression and encryption. IEEE Trans. Inf. Forensics Secur. 16, 3859\u20133873 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"597_CR13","unstructured":"Duda, J.: Asymmetric Numeral Systems. Internet Archive. arxiv:0902.0271 (2009)"},{"key":"597_CR14","volume-title":"The Art of Computer Programming","author":"K Donald","year":"1973","unstructured":"Donald, K.: The Art of Computer Programming. Addison-Wesley, Boston (1973)"},{"key":"597_CR15","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"2001","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Florida (2001)"},{"key":"597_CR16","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Cryptographic Sponges. http:\/\/sponge.noekeon.org\/CSF-0.1.pdf"},{"key":"597_CR17","unstructured":"Guido, B., Joan, D., Micha\u00ebl, P., Gilles\u00a0Van, A.: Duplexing the Sponge: Single-pass Authenticated Encryption and other Applications. Cryptology ePrint Archive, Report 2011\/499, 2011. http:\/\/eprint.iacr.org\/"},{"key":"597_CR18","unstructured":"Alex, B., Adi, S.: Cryptanalytic Time\/Memory\/Data Tradeoffs for Stream Ciphers Lecture Notes in Computer Science, vol 1976, pp. 1\u201313"},{"key":"597_CR19","doi-asserted-by":"crossref","unstructured":"Matsui, M.: Linear Cryptanalysis Method for DES Cipher. Advances in Cryptology \u2014 EUROCRYPT \u201993, pp. 386\u201339. Springer, New York (1994)","DOI":"10.1007\/3-540-48285-7_33"},{"key":"597_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4, 3\u201372 (1991)","journal-title":"J. Cryptol."},{"key":"597_CR21","doi-asserted-by":"crossref","unstructured":"Courtois, N., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. Advances in Cryptology - ASIACRYPT 2002. Lecture Notes in Computer Science, vol. 2501, pp. 267\u2013287","DOI":"10.1007\/3-540-36178-2_17"},{"key":"597_CR22","volume-title":"Cube Attacks on Tweakable Black Box Polynomials. Lecture Notes in Computer Science","author":"I Dinur","year":"2009","unstructured":"Dinur, I., Shamir, A.: Cube Attacks on Tweakable Black Box Polynomials. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2009)"},{"key":"597_CR23","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-13858-4_19","volume-title":"Fast Software Encryption","author":"D Khovratovich","year":"2010","unstructured":"Khovratovich, D., Nikoli\u0107, I.: Rotational cryptanalysis of ARX. In: Fast Software Encryption, pp. 333\u2013346. Springer, New York (2010)"},{"key":"597_CR24","unstructured":"Guido, B., Joan, D., Micha\u00ebl, P., Gilles\u00a0Van, A., Ronny\u00a0Van, K.: CAESAR Submission: Ketje v2 https:\/\/K.team\/files\/Ketjev2-doc2.0.pdf"},{"key":"597_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, New York (2002)"},{"key":"597_CR26","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Fast Software Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 32\u201349","DOI":"10.1007\/11502760_3"},{"issue":"7","key":"597_CR27","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TCSVT.2003.815173","volume":"13","author":"D Marpe","year":"2003","unstructured":"Marpe, D., Schwarz, H., Wiegand, T.: Context-based adaptive binary arithmetic coding in the H.264\/AVC video compression standard. IEEE Trans. Circuits Syst. Video Technol. 13(7), 620\u2013636 (2003)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00597-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-022-00597-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00597-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T15:51:09Z","timestamp":1663948269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-022-00597-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,13]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["597"],"URL":"https:\/\/doi.org\/10.1007\/s10207-022-00597-4","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,13]]},"assertion":[{"value":"13 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}