{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:11:05Z","timestamp":1785831065082,"version":"3.56.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229718","type":"print"},{"value":"9783031229725","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22972-5_16","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:35:48Z","timestamp":1674560148000},"page":"447-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimising Linear Key Recovery Attacks with\u00a0Affine Walsh Transform Pruning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7749-8925","authenticated-orcid":false,"given":"Antonio","family":"Fl\u00f3rez-Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"16_CR1","unstructured":"Data Encryption Standard (DES): Federal Information Processing Standards Publication 46\u20133, U.S. Department of Commerce, National Institute of Standards and Technology (1977, reaffirmed 1988 1993, 1999, withdrawn 2005)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Alves, R., Osorio, P., Swamy, M.: General FFT pruning algorithm. In: Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144), vol. 3, pp. 1192\u20131195 (2000)","DOI":"10.1109\/MWSCAS.2000.951428"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-39887-5_2","volume-title":"Fast Software Encryption","author":"E Biham","year":"2003","unstructured":"Biham, E., Dunkelman, O., Keller, N.: Differential-linear cryptanalysis of serpent. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 9\u201321. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_2"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.46586\/tosc.v2018.i3.215-264","volume":"2018","author":"E Biham","year":"2018","unstructured":"Biham, E., Perle, S.: Conditional linear cryptanalysis - cryptanalysis of DES with less than $$2^{42}$$ complexity. IACR Trans. Symmetric Cryptol. 2018(3), 215\u2013264 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-48071-4_34","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"E Biham","year":"1993","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of the full 16-round DES. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 487\u2013496. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_34"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28628-8_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A Biryukov","year":"2004","unstructured":"Biryukov, A., De Canni\u00e8re, C., Quisquater, M.: On multiple linear approximations. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 1\u201322. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_1"},{"issue":"2","key":"16_CR7","first-page":"162","volume":"2016","author":"C Blondeau","year":"2016","unstructured":"Blondeau, C., Nyberg, K.: Improved parameter estimates for correlation and capacity deviates in linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2016(2), 162\u2013191 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1\u20132","key":"16_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10623-016-0268-6","volume":"82","author":"C Blondeau","year":"2017","unstructured":"Blondeau, C., Nyberg, K.: Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity. Des. Codes Cryptogr. 82(1\u20132), 319\u2013349 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov, A., et al.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.46586\/tosc.v2018.i1.101-125","volume":"2018","author":"A Bogdanov","year":"2018","unstructured":"Bogdanov, A., Tischhauser, E., Vejre, P.S.: Multivariate profiling of hulls for linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2018(1), 101\u2013125 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-70694-8_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Bogdanov","year":"2017","unstructured":"Bogdanov, A., Vejre, P.S.: Linear cryptanalysis of DES with asymmetries. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 187\u2013216. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_7"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-92062-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Broll","year":"2021","unstructured":"Broll, M., Canale, F., Fl\u00f3rez-Guti\u00e9rrez, A., Leander, G., Naya-Plasencia, M.: Generic framework for\u00a0key-guessing improvements. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 453\u2013483. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_16"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)","DOI":"10.1017\/9781108606806"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Castro-Palazuelos, D., Medina-Melendrez, M., Torres-Roman, D., Yuriy, S.: Unified commutation-pruning technique for efficient computation of composite DFTs. EURASIP J. Adv. Sig. Process. 11-2015 (2015)","DOI":"10.1186\/s13634-015-0285-z"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-11925-5_21","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"JY Cho","year":"2010","unstructured":"Cho, J.Y.: Linear cryptanalysis of reduced-round PRESENT. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 302\u2013317. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11925-5_21"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-76788-6_7","volume-title":"Information Security and Cryptology - ICISC 2007","author":"B Collard","year":"2007","unstructured":"Collard, B., Standaert, F.-X., Quisquater, J.-J.: Improving the time complexity of Matsui\u2019s linear cryptanalysis. In: Nam, K.-H., Rhee, G. (eds.) ICISC 2007. LNCS, vol. 4817, pp. 77\u201388. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76788-6_7"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-71039-4_24","volume-title":"Fast Software Encryption","author":"B Collard","year":"2008","unstructured":"Collard, B., Standaert, F.-X., Quisquater, J.-J.: Experiments on the multiple linear cryptanalysis of reduced round serpent. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 382\u2013397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_24"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Cooley, J., Tukey, J.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-45721-1_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Fl\u00f3rez-Guti\u00e9rrez","year":"2020","unstructured":"Fl\u00f3rez-Guti\u00e9rrez, A., Naya-Plasencia, M.: Improving key-recovery in linear attacks: application to 28-round PRESENT. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 221\u2013249. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_9"},{"issue":"6","key":"16_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/97.503281","volume":"3","author":"S He","year":"1996","unstructured":"He, S., Torkelson, M.: Computing partial DFT for comb spectrum evaluation. IEEE Sig. Process. Lett. 3(6), 173\u2013175 (1996)","journal-title":"IEEE Sig. Process. Lett."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-018-9308-x","volume":"32","author":"M Hermelin","year":"2019","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional linear cryptanalysis. J. Cryptol. 32(1), 1\u201334 (2019)","journal-title":"J. Cryptol."},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1109\/TSP.2004.838925","volume":"53","author":"Z Hu","year":"2005","unstructured":"Hu, Z., Wan, H.: A novel generic fast Fourier transform pruning technique and complexity analysis. IEEE Trans. Sig. Process. 53(1), 274\u2013282 (2005)","journal-title":"IEEE Trans. Sig. Process."},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48658-5_3","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"SK Langford","year":"1994","unstructured":"Langford, S.K., Hellman, M.E.: Differential-linear cryptanalysis. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 17\u201325. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_3"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Markel, J.: FFT pruning. IEEE Trans. Audio Electroacoust. (1971)","DOI":"10.1109\/TAU.1971.1162205"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386\u2013397. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_33"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48658-5_1","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: The first experimental cryptanalysis of the data encryption standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1\u201311. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_1"},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TASSP.1986.1164900","volume":"34","author":"K Nagai","year":"1986","unstructured":"Nagai, K.: Pruning the decimation-in-time FFT algorithm with frequency shift. IEEE Trans. Acoust. Speech Sig. Process.\u2018 34(4), 1008\u20131010 (1986)","journal-title":"IEEE Trans. Acoust. Speech Sig. Process.\u2018"},{"issue":"1","key":"16_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00145-007-9013-7","volume":"21","author":"AA Sel\u00e7uk","year":"2008","unstructured":"Sel\u00e7uk, A.A.: On probability of success in linear and differential cryptanalysis. J. Cryptol. 21(1), 131\u2013147 (2008)","journal-title":"J. Cryptol."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Singh, S., Srinivasan, S.: Architecturally efficient FFT pruning algorithm. Electron. Lett. 41(23), 1\u20132 (2005)","DOI":"10.1049\/el:20052994"},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TASSP.1976.1162782","volume":"24","author":"D Skinner","year":"1976","unstructured":"Skinner, D.: Pruning the decimation in-time FFT algorithm. IEEE Trans. Acoust. Speech Sig. Process. 24(2), 193\u2013194 (1976)","journal-title":"IEEE Trans. Acoust. Speech Sig. Process."},{"issue":"3","key":"16_CR31","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1109\/78.205723","volume":"41","author":"H Sorensen","year":"1993","unstructured":"Sorensen, H., Burrus, C.: Efficient computation of the DFT with only a subset of input or output points. IEEE Trans. Sig. Process. 41(3), 1184\u20131200 (1993)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/TASSP.1979.1163246","volume":"27","author":"T Sreenivas","year":"1979","unstructured":"Sreenivas, T., Rao, P.: FFT algorithm for both input and output pruning. IEEE Trans. Acoust. Speech Sig. Process. 27(3), 291\u2013292 (1979)","journal-title":"IEEE Trans. Acoust. Speech Sig. Process."},{"issue":"3","key":"16_CR33","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/LSP.2012.2184283","volume":"19","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, X., Sobelman, G.E., Liu, R.: Generic mixed-radix FFT pruning. IEEE Sig. Process. Lett. 19(3), 167\u2013170 (2012)","journal-title":"IEEE Sig. Process. Lett."},{"issue":"18","key":"16_CR34","doi-asserted-by":"publisher","first-page":"3535","DOI":"10.1002\/sec.1278","volume":"8","author":"L Zheng","year":"2015","unstructured":"Zheng, L., Zhang, S.: FFT-based multidimensional linear attack on PRESENT using the 2-bit-fixed characteristic. Secur. Commun. Netw. 8(18), 3535\u20133545 (2015)","journal-title":"Secur. Commun. Netw."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22972-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:41Z","timestamp":1769216561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22972-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229718","9783031229725"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22972-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}