{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:10:55Z","timestamp":1773774655266,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920616","type":"print"},{"value":"9783030920623","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92062-3_7","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:21:35Z","timestamp":1638300095000},"page":"187-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Practical Key-Recovery Attack on\u00a0805-Round Trivium"],"prefix":"10.1007","author":[{"given":"Chen-Dong","family":"Ye","sequence":"first","affiliation":[]},{"given":"Tian","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03317-9_1","volume-title":"Fast Software Encryption","author":"J-P Aumasson","year":"2009","unstructured":"Aumasson, J.-P., Dinur, I., Meier, W., Shamir, A.: Cube testers and key recovery attacks on reduced-round MD6 and Trivium. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 1\u201322. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_1"},{"key":"7_CR2","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-540-68351-3_18"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-25385-0_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"I Dinur","year":"2011","unstructured":"Dinur, I., G\u00fcneysu, T., Paar, C., Shamir, A., Zimmermann, R.: An experimentally verified attack on full Grain-128 using dedicated reconfigurable hardware. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 327\u2013343. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_18"},{"key":"7_CR4","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":"7_CR5","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":"7_CR6","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":"7_CR7","first-page":"441","volume":"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. IACR Cryptol. ePrint Arch. 2020, 441 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"7_CR8","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":"7_CR9","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":"7_CR10","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":"7_CR11","unstructured":"Joux, A.: Algorithmic Cryptanalysis, 1st edn. Chapman & Hall\/CRC Cryptography and Network Security Series. Chapman and Hall\/CRC (2009)"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10623-019-00674-1","volume":"88","author":"A Kesarwani","year":"2020","unstructured":"Kesarwani, A., Roy, D., Sarkar, S., Meier, W.: New cube distinguishers on NFSR-based stream ciphers. Des. Codes Cryptogr. 88(1), 173\u2013199 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-70694-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Z Li","year":"2017","unstructured":"Li, Z., Bi, W., Dong, X., Wang, X.: Improved conditional cube attacks on Keccak keyed modes with MILP method. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 99\u2013127. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_4"},{"key":"7_CR14","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":"7_CR15","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":"7_CR16","first-page":"32","volume":"2011","author":"P Mroczkowski","year":"2011","unstructured":"Mroczkowski, P., Szmidt, J.: Corrigendum to: the cube attack on stream cipher Trivium and quadraticity tests. IACR Cryptol. ePrint Arch. 2011, 32 (2011)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1049\/iet-ifs.2014.0239","volume":"10","author":"M Rahimi","year":"2016","unstructured":"Rahimi, M., Barmshory, M., Mansouri, M.H., Aref, M.R.: Dynamic cube attack on Grain-v1. IET Inf. Secur. 10(4), 165\u2013172 (2016)","journal-title":"IET Inf. Secur."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-016-0211-x","volume":"82","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S., Maitra, S., Baksi, A.: Observing biases in the state: case studies with Trivium and Trivia-SC. Des. Codes Crypt. 82(1), 351\u2013375 (2016). https:\/\/doi.org\/10.1007\/s10623-016-0211-x","journal-title":"Des. Codes Crypt."},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-17401-8_16","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"P Stankovski","year":"2010","unstructured":"Stankovski, P.: Greedy distinguishers and nonrandomness detectors. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 210\u2013226. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_16"},{"key":"7_CR20","unstructured":"Sun, L., Wang, W., Wang, M.: MILP-aided bit-based division property for primitives with non-bit-permutation linear layers. Cryptology ePrint Archive, Report 2016\/811 (2016)"},{"key":"7_CR21","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"},{"issue":"12","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1109\/TC.2018.2835480","volume":"67","author":"Y Todo","year":"2018","unstructured":"Todo, Y., Isobe, T., Hao, Y., Meier, W.: Cube attacks on non-blackbox polynomials based on division property. IEEE Trans. Comput. 67(12), 1720\u20131736 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR23","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":"7_CR24","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":"7_CR25","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"},{"key":"7_CR26","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"},{"key":"7_CR27","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"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.46586\/tosc.v2019.i3.81-102","volume":"2019","author":"C-D Ye","year":"2019","unstructured":"Ye, C.-D., 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":"7_CR29","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."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92062-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:10:53Z","timestamp":1732925453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92062-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920616","9783030920623"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92062-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","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":"95","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":"28% - 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.21","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":"4.61","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":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}