{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:33:16Z","timestamp":1743154396644,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688899"},{"type":"electronic","value":"9783030688905"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68890-5_9","type":"book-chapter","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:53:48Z","timestamp":1612828428000},"page":"157-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Can a Differential Attack Work for an Arbitrarily Large Number of Rounds?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0736-431X","authenticated-orcid":false,"given":"Nicolas T.","family":"Courtois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-71039-4_6","volume-title":"Fast Software Encryption","author":"NT Courtois","year":"2008","unstructured":"Courtois, N.T., Bard, G.V., Wagner, D.: Algebraic and slide attacks on KeeLoq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 97\u2013115. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_6"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-28368-0_6","volume-title":"Cryptography and Security: From Theory to Applications","author":"NT Courtois","year":"2012","unstructured":"Courtois, N.T., Bard, G.V.: Random permutation statistics and an improved slide-determine attack on KeeLoq. In: Naccache, D. (ed.) Cryptography and Security: From Theory to Applications. LNCS, vol. 6805, pp. 35\u201354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28368-0_6"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-17401-8_14","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"GV Bard","year":"2010","unstructured":"Bard, G.V., Courtois, N.T., Nakahara, J., Sepehrdad, P., Zhang, B.: Algebraic, AIDA\/Cube and side channel analysis of KATAN family of block ciphers. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 176\u2013196. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_14"},{"key":"9_CR4","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). https:\/\/doi.org\/10.1007\/BF00630563","journal-title":"J. Cryptol."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/3-540-46885-4_71","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"L Brown","year":"1990","unstructured":"Brown, L., Seberry, J.: On the design of permutation P in des type cryptosystems. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 696\u2013705. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_71"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s12095-018-0297-2","volume":"11","author":"\u00c7 \u00c7al\u0131k","year":"2018","unstructured":"\u00c7al\u0131k, \u00c7., S\u00f6nmez Turan, M., Peralta, R.: The multiplicative complexity of 6-variable Boolean functions. Cryptogr. Commun. 11(1), 93\u2013107 (2018). https:\/\/doi.org\/10.1007\/s12095-018-0297-2. https:\/\/ia.cr\/2018\/002.pdf","journal-title":"Cryptogr. Commun."},{"issue":"2\u20133","key":"9_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jco.2003.08.010","volume":"20","author":"P Charpin","year":"2004","unstructured":"Charpin, P.: Normal Boolean functions. J. Complex. 20(2\u20133), 245\u2013265 (2004)","journal-title":"J. Complex."},{"key":"9_CR8","unstructured":"Courtois, N.T.: The dark side of security by obscurity and cloning MiFare classic rail and building passes anywhere, anytime. In: SECRYPT 2009, pp. 331\u2013338. INSTICC Press (2009). ISBN 978-989-674-005-4"},{"key":"9_CR9","unstructured":"Courtois, N.T., Mourouzis, T.: Propagation of truncated differentials in GOST. In: SECURWARE (2013). http:\/\/www.thinkmind.org\/download.php?articleid=securware_2013_7_20_30119"},{"key":"9_CR10","unstructured":"Courtois, N.T.: Algebraic complexity reduction and cryptanalysis of GOST. Monograph study on GOST cipher, 224 p. https:\/\/ia.cr\/2011\/626"},{"key":"9_CR11","unstructured":"Courtois, N., Gawinecki, J.A., Song, G.: Contradiction immunity and guess-then-determine attacks on GOST. In: CECC 2912, Tatra Mt. Math. Publ. vol. 53, no. 3, pp. 65\u201379 (2012). http:\/\/www.sav.sk\/journals\/uploads\/0114113604CuGaSo.pdf"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1080\/01611194.2019.1650845","volume":"44","author":"NT Courtois","year":"2020","unstructured":"Courtois, N.T., Georgiou, M.: Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310. Cryptologia 44(1), 20\u201338 (2020). https:\/\/doi.org\/10.1080\/01611194.2019.1650845","journal-title":"Cryptologia"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/01611194.2019.1706062","volume":"44","author":"NT Courtois","year":"2020","unstructured":"Courtois, N.T., Patrick, A., Abbondati, M.: Construction of a polynomial invariant annihilation attack of degree 7 for T-310. Cryptologia 44(4), 289\u2013314 (2020)","journal-title":"Cryptologia"},{"key":"9_CR14","unstructured":"Courtois, N.T.: On the existence of non-linear invariants and algebraic polynomial constructive approach to backdoors in block ciphers. https:\/\/ia.cr\/2018\/807. Accessed 27 Mar 2019"},{"key":"9_CR15","unstructured":"Courtois, N.T., Patrick, A.: Lack of unique factorization as a tool in block cipher cryptanalysis. https:\/\/arxiv.org\/abs\/1905.04684. Accessed 12 May 2019"},{"key":"9_CR16","unstructured":"Courtois, N.T.: Structural nonlinear invariant attacks on T-310: attacking arbitrary Boolean functions. https:\/\/ia.cr\/2018\/1242. Accessed 12 Sept 2019"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Courtois, N.T.: A nonlinear invariant attack on T-310 with the original Boolean function. Cryptologia, 23 Apr 2020. https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01611194.2020.1736207. to appear also in paper version in 2020","DOI":"10.1080\/01611194.2020.1736207"},{"key":"9_CR18","unstructured":"Courtois, N.T.: Invariant hopping attacks on block ciphers. In: Presented at WCC 2019, Abbaye de Saint-Jacut de la Mer, France, 31 March\u20135 April 2019. https:\/\/arxiv.org\/pdf\/2002.03212.pdf. Accessed 8 Feb 2020"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-40921-0_2","volume-title":"Information Security and Cryptology \u2013 ICISC 2019","author":"NT Courtois","year":"2020","unstructured":"Courtois, N.T., Abbondati, M., Ratoanina, H., Grajek, M.: Systematic construction of nonlinear product attacks on block ciphers. In: Seo, J.H. (ed.) ICISC 2019. LNCS, vol. 11975, pp. 20\u201351. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40921-0_2"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-28628-8_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"NT Courtois","year":"2004","unstructured":"Courtois, N.T.: Feistel schemes and bi-linear cryptanalysis. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 23\u201340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_2"},{"key":"9_CR21","unstructured":"Courtois, N.T., et al.: Cryptographic security analysis of T-310. Monography study on the T-310 block cipher, 132 p. 20 May 2017. https:\/\/ia.cr\/2017\/440.pdf. Accessed 29 June 2018"},{"key":"9_CR22","unstructured":"Courtois, N.T., Oprisanu, M.-B.: Ciphertext-only attacks and weak long-term keys in T-310. Cryptologia, 42(4), 316\u2013336 (2018). http:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01611194.2017.1362065"},{"issue":"6","key":"9_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1080\/01611194.2018.1428835","volume":"42","author":"N Courtois","year":"2018","unstructured":"Courtois, N., Drobick, J., Schmeh, K.: Feistel ciphers in East Germany in the communist era. Cryptologia 42(6), 427\u2013444 (2018)","journal-title":"Cryptologia"},{"key":"9_CR24","unstructured":"Courtois, N.T.: Block ciphers: lessons from the cold war. In: Slides presented at 2019 biennial Symposium on Cryptologic History, Laurel, Maryland, US, October 2019. http:\/\/www.nicolascourtois.com\/papers\/Feistel_East_Cold_War_US_Oct2019.pdf"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Courtois, N.T.: The inverse S-Box, non-linear polynomial relations and cryptanalysis of block ciphers. In: Dobbertin, H., Rijmen, V., Sowa, A. (eds.) AES 2004. LNCS, vol. 3373, pp. 170\u2013188. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11506447_15. https:\/\/www.researchgate.net\/publication\/221005723_The_Inverse_S-Box_Non-linear_Polynomial_Relations_and_Cryptanalysis_of_Block_Ciphers","DOI":"10.1007\/11506447_15"},{"key":"9_CR26","unstructured":"Courtois, N.: The inverse S-box and two paradoxes of whitening. Long extended version of the Crypto 2004 rump session presentation, Whitening the AES S-box. http:\/\/www.nicolascourtois.com\/papers\/invglc_rump_c04.pdf"},{"key":"9_CR27","unstructured":"Courtois, N., Oprisanu, M.-B., Schmeh, K.: Linear cryptanalysis and block cipher design in East Germany in the 1970s. Cryptologia (2018). https:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/01611194.2018.1483981"},{"key":"9_CR28","unstructured":"Courtois, N.: The best differential characteristics and subtleties of the Biham-Shamir attacks on DES. https:\/\/ia.cr\/2005\/202"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-49301-4_18","volume-title":"The New Codebreakers","author":"NT Courtois","year":"2016","unstructured":"Courtois, N.T.: An improved differential attack on full GOST. In: Ryan, P.Y.A., Naccache, D., Quisquater, J.-J. (eds.) The New Codebreakers. LNCS, vol. 9100, pp. 282\u2013303. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49301-4_18"},{"key":"9_CR30","unstructured":"Courtois, N.: An improved differential attack on full GOST. Cryptology ePrint Archive, Report 2012\/138, 15 March 2012. https:\/\/ia.cr\/2012\/138. Accessed Dec 2015"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10998-012-2983-8","volume":"65","author":"N Courtois","year":"2012","unstructured":"Courtois, N., Misztal, M.: Aggregated differentials and cryptanalysis of PP-1 and GOST. Periodica Mathematica Hungarica 65(2), 11\u201326 (2012). https:\/\/doi.org\/10.1007\/s10998-012-2983-8. In CECC 2011, 11th Central European Conference on Cryptology","journal-title":"Periodica Mathematica Hungarica"},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1080\/01611194.2014.915266","volume":"39","author":"NT Courtois","year":"2015","unstructured":"Courtois, N.T., Mourouzis, T., Misztal, M., Quisquater, J.J., Song, G.: Can GOST be made secure against differential cryptanalysis? Cryptologia 39(2), 145\u2013156 (2015)","journal-title":"Cryptologia"},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/01611194.2014.988362","volume":"39","author":"N Courtois","year":"2015","unstructured":"Courtois, N.: On multiple symmetric fixed points in GOST. Cryptologia 39(4), 322\u2013334 (2015)","journal-title":"Cryptologia"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-60590-8_5","volume-title":"Fast Software Encryption","author":"H Dobbertin","year":"1995","unstructured":"Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61\u201374. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_5"},{"key":"9_CR35","unstructured":"Dubuc, S.: Etude des propri\u00e9t\u00e9s de d\u00e9g\u00e9n\u00e9rescence et de normalit\u00e9 des fonctions bool\u00e9ennes et construction de fonctions q-aires parfaitement non-lin\u00e9aires, Ph.D. thesis, Universit\u00e9 de Caen (2001)"},{"key":"9_CR36","unstructured":"Feistel, H., Notz, W.A., Smith, J.L.: Cryptographic techniques for machine to machine data communications, 27 Dec 1971, Report RC-3663, IBM T. J. Watson Research (1971)"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-36095-4_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"JD Goli\u0107","year":"2013","unstructured":"Goli\u0107, J.D.: Cryptanalytic attacks on MIFARE classic protocol. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 239\u2013258. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_16"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-49264-X_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201995","author":"C Harpes","year":"1995","unstructured":"Harpes, C., Kramer, G.G., Massey, J.L.: A generalization of linear cryptanalysis and the applicability of Matsui\u2019s Piling-up lemma. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 24\u201338. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_3"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0052331","volume-title":"Fast Software Encryption","author":"C Harpes","year":"1997","unstructured":"Harpes, C., Massey, J.L.: Partitioning cryptanalysis. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 13\u201327. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052331"},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-60590-8_16","volume-title":"Fast Software Encryption","author":"LR Knudsen","year":"1995","unstructured":"Knudsen, L.R.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196\u2013211. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_16"},{"key":"9_CR41","unstructured":"Kovalchuk, L.V.: Generalized Markov ciphers: evaluation of practical security against differential cryptanalysis. In: Proceedings of 5th All-Russian Scientific Conference MaBIT-06, 25\u201327 Oct 2006, MGU, Moscow, pp. 595\u2013599 (2006). (in Russian)"},{"key":"9_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46416-6_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L., Murphy, S.: Markov ciphers and differential cryptanalysis. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 17\u201338. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_2"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-22792-9_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Leander","year":"2011","unstructured":"Leander, G., Abdelraheem, M.A., AlKhzaimi, H., Zenner, E.: A cryptanalysis of PRINTcipher: the invariant subspace attack. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 206\u2013221. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_12"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Knudsen, L.R., Robshaw, M.J.B.: Non-Linear Characteristics in Linear Cryptoanalysis. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 224\u2013236. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_20"},{"issue":"195","key":"9_CR45","first-page":"403","volume":"57","author":"JA Maiorana","year":"1991","unstructured":"Maiorana, J.A.: A classification of the cosets of the Reed-Muller code R(1,6). Math. Comput. 57(195), 403\u2013414 (1991)","journal-title":"Math. Comput."},{"key":"9_CR46","unstructured":"John Nash, handwritten letters and documents relating to their evaluation, available at NSA crypto museum, January-March 1955. cryptologicfoundation.org. https:\/\/www.nsa.gov\/news-features\/declassified-documents\/nash-letters\/assets\/files\/nash_letters1.pdf. declassified in 2012"},{"key":"9_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-48071-4_41","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"K Nyberg","year":"1993","unstructured":"Nyberg, K., Knudsen, L.R.: Provable security against differential cryptanalysis. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 566\u2013574. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_41"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-56877-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Peyrin","year":"2020","unstructured":"Peyrin, T., Wang, H.: The MALICIOUS framework: embedding backdoors into tweakable block ciphers. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 249\u2013278. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_9"},{"key":"9_CR49","unstructured":"Referat 11: Kryptologische Analyse des Chiffrierger\u00e4tes T-310\/50. Central Cipher Organ, Ministry of State Security of the GDR, document referenced as \u2018ZCO 402\/80\u2019, a.k.a. MfS-Abt-XI-594, Berlin, 123 p. (1980)"},{"issue":"3","key":"9_CR50","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/01611190600632457","volume":"30","author":"K Schmeh","year":"2006","unstructured":"Schmeh, K.: The East German encryption machine T-310 and the algorithm it used. Cryptologia 30(3), 251\u2013257 (2006)","journal-title":"Cryptologia"},{"key":"9_CR51","first-page":"1","volume":"32","author":"Y Todo","year":"2018","unstructured":"Todo, Y., Leander, G., Sasaki, Y.: Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM and Midori 64. J. Cryptol. 32, 1\u201340 (2018)","journal-title":"J. Cryptol."},{"key":"9_CR52","unstructured":"Vielhaber, M.: AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. https:\/\/ia.cr\/2009\/402"},{"key":"9_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-27239-9_14","volume-title":"Cryptography and Coding","author":"R Winter","year":"2015","unstructured":"Winter, R., Salagean, A., Phan, R.C.-W.: Comparison of cube attacks over different vector spaces. In: Groth, J. (ed.) IMACC 2015. LNCS, vol. 9496, pp. 225\u2013238. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27239-9_14"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68890-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:03:29Z","timestamp":1612829009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68890-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688899","9783030688905"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68890-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"2 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","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":"15","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":"3","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":"29% - 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":"0.8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}