{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:47Z","timestamp":1740122507900,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Institute of Information and Communications Technology Planning","award":["2021-0-00779","2022-0-01202"],"award-info":[{"award-number":["2021-0-00779","2022-0-01202"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10623-023-01199-4","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T13:02:56Z","timestamp":1677762176000},"page":"2237-2254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition and mix: generalizing the swap-or-not shuffle"],"prefix":"10.1007","volume":"91","author":[{"given":"Nam-Su","family":"Jho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5471-9350","authenticated-orcid":false,"given":"Jooyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"1199_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology-CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle C., Jean J., K\u0161lbl S., Leander G., Moradi A., Peyrin T., Sasaki Y., Sasdrich P., Sim S.M.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Advances in Cryptology-CRYPTO 2016, pp. 123\u2013153. Springer, Berlin Heidelberg (2016)."},{"key":"1199_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-05445-7_19","volume-title":"Selected Areas in Cryptography","author":"M Bellare","year":"2009","unstructured":"Bellare M., Ristenpart T., Rogaway P., Stegers T.: Format-preserving encryption. In: Selected Areas in Cryptography, pp. 295\u2013312. Springer, Berlin Heidelberg (2009)."},{"key":"1199_CR3","unstructured":"Bellare M., Rogaway P., Spies T.: The FFX mode of operation for format-preserving encryption. Unpublished NIST proposal (2010)"},{"key":"1199_CR4","unstructured":"Brier E., Peyrin T., Stern J. BPS: a format-preserving encryption proposal. Submission to NIST, available from their website (2010)."},{"key":"1199_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology-EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen S., Steinberger J.: Tight security bounds for key-alternating ciphers. In: Advances in Cryptology-EUROCRYPT 2014, pp. 327\u2013350. Springer, Berlin Heidelberg (2014)."},{"key":"1199_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-11799-2_17","volume-title":"Theory of Cryptography","author":"JS Coron","year":"2010","unstructured":"Coron J.S., Dodis Y., Mandal A., Seurin Y.: A domain extender for the ideal cipher. In: Theory of Cryptography, pp. 273\u2013289. Springer, Berlin Heidelberg (2010)."},{"issue":"3","key":"1199_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001459900025","volume":"10","author":"S Even","year":"1997","unstructured":"Even S., Mansour Y.: A construction of a cipher from a single pseudorandom permutation. J. Cryptol. 10(3), 151\u2013161 (1997).","journal-title":"J. Cryptol."},{"key":"1199_CR8","first-page":"1","volume-title":"Advances in Cryptology-CRYPTO 2012","author":"VT Hoang","year":"2012","unstructured":"Hoang V.T., Morris B., Rogaway P.: An enciphering scheme based on a card shuffle. In: Advances in Cryptology-CRYPTO 2012, pp. 1\u201313. Springer, Berlin Heidelberg (2012)."},{"key":"1199_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology-CRYPTO 2007","author":"U Maurer","year":"2007","unstructured":"Maurer U., Pietrzak K., Renner R.: Indistinguishability amplification. In: Advances in Cryptology-CRYPTO 2007, pp. 130\u2013149. Springer, Berlin Heidelberg (2007)."},{"key":"1199_CR10","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-03356-8_17","volume-title":"Advances in Cryptology-CRYPTO 2009","author":"B Morris","year":"2009","unstructured":"Morris B., Rogaway P., Stegers T.: How to encipher messages on a small domain. In: Advances in Cryptology-CRYPTO 2009, pp. 286\u2013302. Springer, Berlin Heidelberg (2009)."},{"key":"1199_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-55220-5_18","volume-title":"Advances in Cryptology-EUROCRYPT 2014","author":"B Morris","year":"2014","unstructured":"Morris B., Rogaway P.: Sometimes-Recurse Shuffle. In: Advances in Cryptology-EUROCRYPT 2014, pp. 311\u2013326. Springer, Berlin Heidelberg (2014)."},{"key":"1199_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45146-4_30","volume-title":"Advances in Cryptology-CRYPTO 2003","author":"J Patarin","year":"2003","unstructured":"Patarin J.: Luby-Rackoff: $$7$$ rounds are enough for $$2n(1-\\varepsilon )$$ security. In: Advances in Cryptology-CRYPTO 2003, pp. 513\u2013529. Springer, Berlin Heidelberg (2003)."},{"key":"1199_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology-CRYPTO 2004","author":"J Patarin","year":"2004","unstructured":"Patarin J.: Security of random Feistel schemes with 5 or more rounds. In: Advances in Cryptology-CRYPTO 2004, pp. 106\u2013122. Springer, Berlin Heidelberg (2004)."},{"key":"1199_CR14","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-40041-4_22","volume-title":"Advances in Cryptology-CRYPTO 2013","author":"T Ristenpart","year":"2013","unstructured":"Ristenpart T., Yilek S.: The mix-and-cut shuffle: small-domain encryption secure against N queries. In: Advances in Cryptology-CRYPTO 2013, pp. 392\u2013409. Springer, Berlin Heidelberg (2013)."},{"key":"1199_CR15","first-page":"254","volume":"2012","author":"E Stefanov","year":"2012","unstructured":"Stefanov E., Shi E.: FastPRP: fast pseudo-random permutations for small domains. IACR Cryptol. 2012, 254 (2012).","journal-title":"IACR Cryptol."},{"issue":"344","key":"1199_CR16","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1080\/01621459.1973.10481434","volume":"68","author":"EO Thorp","year":"1973","unstructured":"Thorp E.O.: Nonrandom shuffling with applications to the game of Faro. J. Am. Stat. Assoc. 68(344), 842\u2013847 (1973).","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01199-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01199-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01199-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T16:12:50Z","timestamp":1685031170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01199-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1199"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01199-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"18 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}