{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:11:07Z","timestamp":1785831067530,"version":"3.56.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457204","type":"print"},{"value":"9783030457211","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45721-1_9","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"221-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Fl\u00f3rez-Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mar\u00eda","family":"Naya-Plasencia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-37682-5_26","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"MA Abdelraheem","year":"2013","unstructured":"Abdelraheem, M.A.: Estimating the probabilities of low-weight differential and linear approximations on PRESENT-like ciphers. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 368\u2013382. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_26"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-46800-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Bar-On","year":"2015","unstructured":"Bar-On, A., Dinur, I., Dunkelman, O., Lallemand, V., Keller, N., Tsaban, B.: Cryptanalysis of SP networks with partial non-linear layers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 315\u2013342. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_13"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-09843-2_16","volume-title":"Advances in Information and Computer Security","author":"A Bay","year":"2014","unstructured":"Bay, A., Huang, J., Vaudenay, S.: Improved linear cryptanalysis of reduced-round MIBS. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 204\u2013220. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09843-2_16"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK lightweight block ciphers. In: Proceedings of the 52nd Annual Design Automation Conference, San Francisco, CA, USA, 7\u201311 June 2015, pp. 175:1\u2013175:6. ACM (2015)","DOI":"10.1145\/2744769.2747946"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03326-2_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T Beyne","year":"2018","unstructured":"Beyne, T.: Block cipher invariants as eigenvectors of correlation matrices. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 3\u201331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_1"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.13154\/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 242 complexity. IACR Trans. Symmetric Cryptol. 2018(3), 215\u2013264 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i3.215-264","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"9_CR7","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"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-38348-9_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Blondeau","year":"2013","unstructured":"Blondeau, C., Nyberg, K.: New links between differential and linear cryptanalysis. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 388\u2013404. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_24"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.13154\/tosc.v2016.i2.162-191","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). https:\/\/doi.org\/10.13154\/tosc.v2016.i2.162-191","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-662-43414-7_16","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov, A., Geng, H., Wang, M., Wen, L., Collard, B.: Zero-correlation linear cryptanalysis with FFT and improved attacks on ISO standards Camellia and CLEFIA. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 306\u2013323. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_16"},{"key":"9_CR11","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":"9_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.13154\/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). https:\/\/doi.org\/10.13154\/tosc.v2018.i1.101-125","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00145-016-9251-7","volume":"31","author":"C Boura","year":"2018","unstructured":"Boura, C., Lallemand, V., Naya-Plasencia, M., Suder, V.: Making the impossible possible. J. Cryptol. 31(1), 101\u2013133 (2018). https:\/\/doi.org\/10.1007\/s00145-016-9251-7","journal-title":"J. Cryptol."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-45611-8_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"C Boura","year":"2014","unstructured":"Boura, C., Naya-Plasencia, M., Suder, V.: Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, LBlock and Simon. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part I. LNCS, vol. 8873, pp. 179\u2013199. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_10"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-40041-4_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Canteaut","year":"2013","unstructured":"Canteaut, A., Naya-Plasencia, M., Vayssi\u00e8re, B.: Sieve-in-the-middle: improved MITM attacks. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 222\u2013240. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_13"},{"key":"9_CR16","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":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-00862-7_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"B Collard","year":"2009","unstructured":"Collard, B., Standaert, F.: A statistical saturation attack against the block cipher PRESENT. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 195\u2013210. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_13"},{"key":"9_CR18","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., Quisquater, 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":"9_CR19","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., Quisquater, 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":"9_CR20","doi-asserted-by":"crossref","unstructured":"Daemen, J., Peeters, M., Assche, G.V., Rijmen, V.: Nessie proposal: the block cipher Noekeon. Nessie submission (2000). http:\/\/gro.noekeon.org\/","DOI":"10.1007\/10721064_22"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1515\/JMC.2007.011","volume":"1","author":"J Daemen","year":"2007","unstructured":"Daemen, J., Rijmen, V.: Probability distributions of correlation and differentials in block ciphers. J. Math. Cryptol. 1(3), 221\u2013242 (2007). https:\/\/doi.org\/10.1515\/JMC.2007.011","journal-title":"J. Math. Cryptol."},{"key":"9_CR22","unstructured":"Datta, N., Ghoshal, A., Mukhopadhyay, D., Patranabis, S., Picek, S., Sadhukhan, R.: TRIFLE. Candidates to the NIST Lightweight competition (2019). https:\/\/csrc.nist.gov\/projects\/lightweight-cryptography\/round-1-candidates"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-04159-4_4","volume-title":"Selected Areas in Cryptography","author":"J Etrog","year":"2009","unstructured":"Etrog, J., Robshaw, M.J.B.: The cryptanalysis of reduced-round SMS4. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 51\u201365. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_4"},{"key":"9_CR24","unstructured":"Florez-Gutierrez, A.: Cryptanalysis of TRIFLE-BC. Official comment to the NIST-LWC forum (2019). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Lightweight-Cryptography\/documents\/round-1\/official-comments\/TRIFLE-official-comment.pdf"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-70500-0_15","volume-title":"Information Security and Privacy","author":"M Hermelin","year":"2008","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional linear cryptanalysis of reduced round serpent. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 203\u2013215. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_15"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-03317-9_13","volume-title":"Fast Software Encryption","author":"M Hermelin","year":"2009","unstructured":"Hermelin, M., Cho, J.Y., Nyberg, K.: Multidimensional extension of Matsui\u2019s algorithm 2. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 209\u2013227. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_13"},{"key":"9_CR27","unstructured":"Hermelin, M., Nyberg, K.: Linear cryptanalysis using multiple linear approximations. Cryptology ePrint Archive, Report 2011\/093 (2011). https:\/\/eprint.iacr.org\/2011\/093"},{"issue":"1","key":"9_CR28","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. Signal Process. 53(1), 274\u2013282 (2005). https:\/\/doi.org\/10.1109\/TSP.2004.838925","journal-title":"IEEE Trans. Signal Process."},{"key":"9_CR29","unstructured":"Kim, T.H., Kim, J., Hong, S., Sung, J.: Linear and differential cryptanalysis of reduced SMS4 block cipher. IACR Cryptology ePrint Archive 2008, 281 (2008). http:\/\/eprint.iacr.org\/2008\/281"},{"issue":"6","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11390-014-1495-9","volume":"29","author":"M Liu","year":"2014","unstructured":"Liu, M., Chen, J.: Improved linear attacks on the Chinese block cipher standard. J. Comput. Sci. Technol. 29(6), 1123\u20131133 (2014). https:\/\/doi.org\/10.1007\/s11390-014-1495-9","journal-title":"J. Comput. Sci. Technol."},{"key":"9_CR31","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\u2014EUROCRYPT 1993","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":"9_CR32","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"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-10433-6_5","volume-title":"Cryptology and Network Security","author":"JJ Nakahara","year":"2009","unstructured":"Nakahara, J.J., Sepehrdad, P., Zhang, B., Wang, M.: Linear (Hull) and algebraic cryptanalysis of the block cipher PRESENT. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 58\u201375. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_5"},{"key":"9_CR34","unstructured":"National Institute of Standards and Technology (ed.): \u201cFIPS-46: DataEncryption Standard (DES)\u201d revised as FIPS 46-1:1988, FIPS 46-2:1993, FIPS46-3:1999 (1979). http:\/\/csrc.nist.gov\/publications\/fips\/fips46-3\/fips46-3.pdf"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-22497-3_5","volume-title":"Information Security and Privacy","author":"PH Nguyen","year":"2011","unstructured":"Nguyen, P.H., Wu, H., Wang, H.: Improving the Algorithm 2 in multidimensional linear cryptanalysis. In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 61\u201374. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22497-3_5"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0053460","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1994","author":"K Nyberg","year":"1995","unstructured":"Nyberg, K.: Linear approximation of block ciphers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 439\u2013444. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053460"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-05445-7_16","volume-title":"Selected Areas in Cryptography","author":"K Ohkuma","year":"2009","unstructured":"Ohkuma, K.: Weak keys of reduced-round PRESENT for linear cryptanalysis. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 249\u2013265. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_16"},{"issue":"1","key":"9_CR38","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). https:\/\/doi.org\/10.1007\/s00145-007-9013-7","journal-title":"J. Cryptol."},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-12280-9_5","volume-title":"Cryptology and Network Security","author":"Y Todo","year":"2014","unstructured":"Todo, Y., Aoki, K.: FFT key recovery for integral attack. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 64\u201381. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12280-9_5"},{"key":"9_CR40","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6313-6","volume-title":"Hadamard Matrix Analysis and Synthesis - With Applications to Communications and Signal\/Image Processing","author":"RK Yarlagadda","year":"1997","unstructured":"Yarlagadda, R.K., Hershey, J.E.: Hadamard Matrix Analysis and Synthesis - With Applications to Communications and Signal\/Image Processing. The Springer International Series in Engineering and Computer Science, vol. 383. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-1-4615-6313-6"},{"issue":"18","key":"9_CR41","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). https:\/\/doi.org\/10.1002\/sec.1278","journal-title":"Secur. Commun. Netw."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45721-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:03:06Z","timestamp":1682899386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45721-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457204","9783030457211"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45721-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"81","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":"22% - 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":"20","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"}]}}