{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T03:59:49Z","timestamp":1726199989425},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031354854"},{"type":"electronic","value":"9783031354861"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35486-1_3","type":"book-chapter","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T13:02:10Z","timestamp":1686747730000},"page":"53-71","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Correlation Cube Attack Based on\u00a0Division Property"],"prefix":"10.1007","author":[{"given":"Cheng","family":"Che","sequence":"first","affiliation":[]},{"given":"Tian","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"3_CR1","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":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-662-43933-3_26","volume-title":"Fast Software Encryption","author":"P-A Fouque","year":"2014","unstructured":"Fouque, P.-A., Vannet, T.: Improving key recovery to 784 and 799 rounds of trivium using optimized cube attacks. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 502\u2013517. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_26"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-93638-3_11","volume-title":"Information Security and Privacy","author":"C Ye","year":"2018","unstructured":"Ye, C., Tian, T.: A new framework for finding nonlinear superpolies in cube attacks against trivium-like ciphers. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 172\u2013187. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_11"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-63697-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Todo","year":"2017","unstructured":"Todo, Y., Isobe, T., Hao, Y., Meier, W.: Cube attacks on non-blackbox polynomials based on division property. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 250\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_9"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-96884-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Q Wang","year":"2018","unstructured":"Wang, Q., Hao, Y., Todo, Y., Li, C., Isobe, T., Meier, W.: Improved division property based cube attacks exploiting algebraic properties of superpoly. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 275\u2013305. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_10"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-030-34618-8_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"S Wang","year":"2019","unstructured":"Wang, S., Hu, B., Guan, J., Zhang, K., Shi, T.: MILP-aided method of searching division property using three subsets\u00a0and applications. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 398\u2013427. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_14"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.46586\/tosc.v2019.i3.81-102","volume":"2019","author":"C Ye","year":"2019","unstructured":"Ye, C., Tian, T.: Revisit division property based cube attacks: key-recovery or distinguishing attacks? IACR Trans. Symmetric Cryptol. 2019(3), 81\u2013102 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1049\/iet-ifs.2019.0323","volume":"14","author":"C-D Ye","year":"2020","unstructured":"Ye, C.-D., Tian, T.: Algebraic method to recover superpolies in cube attacks. IET Inf. Secur. 14(4), 430\u2013441 (2020)","journal-title":"IET Inf. Secur."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-030-45721-1_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Y Hao","year":"2020","unstructured":"Hao, Y., Leander, G., Meier, W., Todo, Y., Wang, Q.: Modeling for three-subset division property without unknown subset. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 466\u2013495. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_17"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-64837-4_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"K Hu","year":"2020","unstructured":"Hu, K., Sun, S., Wang, M., Wang, Q.: An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 446\u2013476. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_15"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-030-92062-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"K Hu","year":"2021","unstructured":"Hu, K., Sun, S., Todo, Y., Wang, M., Wang, Q.: Massive superpoly recovery with\u00a0nested monomial predictions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 392\u2013421. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_14"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-031-22972-5_19","volume-title":"Advances in Cryptology","author":"J He","year":"2022","unstructured":"He, J., Hu, K., Preneel, B., Wang, M.: Stretching cube attacks: improved methods to recover massive superpolies. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 537\u2013566. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_19"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-92062-3_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"C-D Ye","year":"2021","unstructured":"Ye, C.-D., Tian, T.: A practical key-recovery attack on\u00a0805-round trivium. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 187\u2013213. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_7"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.46586\/tosc.v2021.i4.100-123","volume":"2021","author":"Y Sun","year":"2021","unstructured":"Sun, Y.: Automatic search of cubes for attacking stream ciphers. IACR Trans. Symmetric Cryptol. 2021(4), 100\u2013123 (2021)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-031-26553-2_19","volume-title":"Information Security and Cryptology","author":"C Che","year":"2023","unstructured":"Che, C., Tian, T.: An experimentally verified attack on 820-round trivium. In: Deng, Y., Yung, M. (eds.) Inscrypt 2022. LNCS, vol. 13837, pp. 357\u2013369. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-26553-2_19"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-21702-9_10","volume-title":"Fast Software Encryption","author":"I Dinur","year":"2011","unstructured":"Dinur, I., Shamir, A.: Breaking grain-128 with dynamic cube attacks. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 167\u2013187. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21702-9_10"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-56614-6_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Huang","year":"2017","unstructured":"Huang, S., Wang, X., Xu, G., Wang, M., Zhao, J.: Conditional cube attack on reduced-round Keccak sponge function. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 259\u2013288. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_9"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-319-78375-8_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Liu","year":"2018","unstructured":"Liu, M., Yang, J., Wang, W., Lin, D.: Correlation cube attacks: from weak-key distinguisher to key recovery. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 715\u2013744. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_23"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-63697-9_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Liu","year":"2017","unstructured":"Liu, M.: Degree evaluation of NFSR-based cryptosystems. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 227\u2013249. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_8"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-46800-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"Y Todo","year":"2015","unstructured":"Todo, Y.: Structural evaluation by generalized integral property. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 287\u2013314. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_12"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-662-52993-5_18","volume-title":"Fast Software Encryption","author":"Y Todo","year":"2016","unstructured":"Todo, Y., Morii, M.: Bit-based division property and application to Simon family. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 357\u2013377. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_18"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-662-53887-6_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"Z Xiang","year":"2016","unstructured":"Xiang, Z., Zhang, W., Bao, Z., Lin, D.: Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 648\u2013678. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_24"},{"unstructured":"Gurobi Optimization. http:\/\/www.gurobi.com","key":"3_CR23"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-68351-3_18","volume-title":"New Stream Cipher Designs","author":"C De Canni\u00e8re","year":"2008","unstructured":"De Canni\u00e8re, C., Preneel, B.: Trivium. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 244\u2013266. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_18"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35486-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T23:02:29Z","timestamp":1687215749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35486-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031354854","9783031354861"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35486-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","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":"acisp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qut.edu.au\/about\/faculty-of-science\/school-of-computer-science\/acisp","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":"87","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":"27","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":"31% - 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":"3.5","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)"}}]}}