{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T21:37:57Z","timestamp":1783460277111,"version":"3.55.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319968834","type":"print"},{"value":"9783319968841","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96884-1_22","type":"book-chapter","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T10:33:49Z","timestamp":1532428429000},"page":"662-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":83,"title":["Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Dobraunig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Eichlseder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Grassi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Virginie","family":"Lallemand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregor","family":"Leander","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eik","family":"List","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Mendel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Rechberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,25]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1644001.1644010","volume":"37","author":"MR Albrecht","year":"2010","unstructured":"Albrecht, M.R., Bard, G.V., Hart, W.: Algorithm 898: efficient multiplication of dense matrices over GF(2). ACM Trans. Math. Softw. 37(1), 9:1\u20139:14 (2010)","journal-title":"ACM Trans. Math. Softw."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. Cryptology ePrint Archive, Report 2016\/687 (2016)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"22_CR5","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The Keccak reference (version 3.0) (2011). http:\/\/keccak.noekeon.org"},{"key":"22_CR6","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak specifications. Submission to NIST (Round 3) (2011). http:\/\/keccak.noekeon.org"},{"key":"22_CR7","unstructured":"Biere, A.: Lingeling, plingeling and treengeling entering the SAT Competition 2013. In: Balint, A., Belov, A., Heule, M., J\u00e4rvisalo, M. (eds.) SAT Competition 2013, vol. B-2013-1, pp. 51\u201352 (2013). http:\/\/fmv.jku.at\/lingeling\/"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2\u201321. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_1"},{"key":"22_CR9","unstructured":"Bile, C., Perret, L., Faug\u00e8re, J.C.: Algebraic cryptanalysis of RASTA. Technical report (2017)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-45611-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"A Biryukov","year":"2014","unstructured":"Biryukov, A., Bouillaguet, C., Khovratovich, D.: Cryptographic schemes based on the ASASA structure:\u00a0black-box,\u00a0white-box, and\u00a0public-key (extended abstract). In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 63\u201384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_4"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-662-47989-6_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"A Biryukov","year":"2015","unstructured":"Biryukov, A., Perrin, L.: On reverse-engineering S-Boxes with hidden design criteria or structure. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 116\u2013140. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_6"},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00145-010-9062-1","volume":"23","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Shamir, A.: Structural cryptanalysis of SASAS. J. Cryptol. 23(4), 505\u2013518 (2010)","journal-title":"J. Cryptol."},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theor. Comput. Sci. 235(1), 43\u201357 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: ECCC, vol. 18, p. 111 (2011)","DOI":"10.1145\/2090236.2090262"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-52993-5_16","volume-title":"Fast Software Encryption","author":"A Canteaut","year":"2016","unstructured":"Canteaut, A., Carpov, S., Fontaine, C., Lepoint, T., Naya-Plasencia, M., Paillier, P., Sirdey, R.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 313\u2013333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_16"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., Zaverucha, G.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: CCS, pp. 1825\u20131842. ACM (2017)","DOI":"10.1145\/3133956.3133997"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-54631-0_18","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 311\u2013328. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_18"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-45146-4_11","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176\u2013194. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_11"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_21"},{"key":"22_CR22","unstructured":"Daemen, J.: Cipher and hash function design - strategies based on linear and differential cryptanalysis. Ph.D. thesis, Katholieke Universiteit Leuven (1995)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11836810_13","volume-title":"Information Security","author":"C Canni\u00e8re","year":"2006","unstructured":"Canni\u00e8re, C.: Trivium: a stream cipher construction inspired by block cipher design principles. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 171\u2013186. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11836810_13"},{"key":"22_CR24","unstructured":"Dinur, I., Dunkelman, O., Kranz, T., Leander, G.: Decomposing the ASASA block cipher construction. Cryptology ePrint Archive, Report 2015\/507 (2015)"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-662-48800-3_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"I Dinur","year":"2015","unstructured":"Dinur, I., Liu, Y., Meier, W., Wang, Q.: Optimized interpolation attacks on LowMC. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 535\u2013560. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_22"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-01001-9_16","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"I Dinur","year":"2009","unstructured":"Dinur, I., Shamir, A.: Cube attacks on tweakable black box polynomials. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 278\u2013299. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_16"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-30840-1_6","volume-title":"Information Security and Cryptology \u2013 ICISC 2015","author":"C Dobraunig","year":"2016","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F.: Higher-order cryptanalysis of LowMC. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 87\u2013101. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_6"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-53018-4_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Duval","year":"2016","unstructured":"Duval, S., Lallemand, V., Rotella, Y.: Cryptanalysis of the FLIP family of stream ciphers. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 457\u2013475. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_17"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"MJ Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. Cryptology ePrint Archive, Report 2012\/099","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-662-47989-6_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"H Gilbert","year":"2015","unstructured":"Gilbert, H., Pl\u00fbt, J., Treger, J.: Key-recovery attack on the ASASA cryptosystem with expanding S-Boxes. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 475\u2013490. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_23"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: CCS, pp. 430\u2013443. ACM (2016)","DOI":"10.1145\/2976749.2978332"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-662-46706-0_2","volume-title":"Fast Software Encryption","author":"V Grosso","year":"2015","unstructured":"Grosso, V., Leurent, G., Standaert, F.-X., Var\u0131c\u0131, K.: LS-Designs: bitslice encryption for efficient masked software implementations. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 18\u201337. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_2"},{"key":"22_CR36","unstructured":"Halevi, S., Shoup, V.: Design and implementation of a homomorphic-encryption library (2013). https:\/\/github.com\/shaih\/HElib\/"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"22_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Joux, A., Vitse, V.: A crossbred algorithm for solving Boolean polynomial systems. Cryptology ePrint Archive, Report 2017\/372","DOI":"10.1007\/978-3-319-76620-1_1"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-45661-9_9","volume-title":"Fast Software Encryption","author":"L Knudsen","year":"2002","unstructured":"Knudsen, L., Wagner, D.: Integral cryptanalysis. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol. 2365, pp. 112\u2013127. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45661-9_9"},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4615-2694-0_23","volume-title":"Communications and Cryptography","author":"Xuejia Lai","year":"1994","unstructured":"Lai, X.: Higher order derivatives and differential cryptanalysis. In: Communications and Cryptography: Two Sides of One Tapestry, pp. 227\u2013233. Kluwer Academic Publishers (1994)"},{"key":"22_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-38980-1_6","volume-title":"Applied Cryptography and Network Security","author":"S Laur","year":"2013","unstructured":"Laur, S., Talviste, R., Willemson, J.: From oblivious AES to efficient and secure database join in the multiparty setting. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 84\u2013101. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_6"},{"key":"22_CR43","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":"22_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"22_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48800-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"B Minaud","year":"2015","unstructured":"Minaud, B., Derbez, P., Fouque, P.-A., Karpman, P.: Key-recovery attacks on ASASA. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 3\u201327. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_1"},{"key":"22_CR46","unstructured":"National Institute of Standards and Technology: FIPS PUB 202: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. U.S. Department of Commerce, August 2015"},{"key":"22_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"22_CR48","unstructured":"Raddum, H.: Personal Communication (2017)"},{"issue":"1","key":"22_CR49","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/rsa.3240040108","volume":"4","author":"D Randall","year":"1993","unstructured":"Randall, D.: Efficient generation of random nonsingular matrices. Random Struct. Algorithms 4(1), 111\u2013118 (1993)","journal-title":"Random Struct. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96884-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:01:21Z","timestamp":1751760081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96884-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968834","9783319968841"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}