{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:47:56Z","timestamp":1742921276302,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789813347052"},{"type":"electronic","value":"9789813347069"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-33-4706-9_8","type":"book-chapter","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T06:03:03Z","timestamp":1606716183000},"page":"108-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear and Partly-Pseudo-Linear Cryptanalysis of Reduced-Round SPARX\u00a0Cipher"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Alzakari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Poorvi","family":"Vora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,1]]},"reference":[{"key":"8_CR1","unstructured":"Ashur, T., Bodden, D.: Linear Cryptanalysis of Reduced-Round Speck (2016)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-99136-8_8","volume-title":"Information Security","author":"D Bodden","year":"2018","unstructured":"Bodden, D.: Linear cryptanalysis of reduced-round speck with a heuristic approach: automatic search for linear trails. In: Chen, L., Manulis, M., Schneider, S. (eds.) ISC 2018. LNCS, vol. 11060, pp. 132\u2013150. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99136-8_8"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-25937-4_4","volume-title":"Fast Software Encryption","author":"JY Cho","year":"2004","unstructured":"Cho, J.Y., Pieprzyk, J.: Algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 49\u201364. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_4"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-75496-1_16","volume-title":"Information Security","author":"JY Cho","year":"2007","unstructured":"Cho, J.Y., Pieprzyk, J.: Multiple modular additions and crossword puzzle attack on NLSv2. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 230\u2013248. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75496-1_16"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-662-53887-6_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Dinu","year":"2016","unstructured":"Dinu, D., Perrin, L., Udovenko, A., Velichkov, V., Gro\u00dfsch\u00e4dl, J., Biryukov, A.: Design strategies for ARX with provable bounds: Sparx and LAX. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 484\u2013513. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_18"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/0161-110291890885","volume":"26","author":"HM Heys","year":"2002","unstructured":"Heys, H.M.: A tutorial on linear and differential cryptanalysis. Cryptologia 26, 189\u2013221 (2002). https:\/\/doi.org\/10.1080\/0161-110291890885","journal-title":"Cryptologia"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Huang, M., Wang, L.: Automatic search for the linear (hull) characteristics of ARX ciphers: applied to SPECK, SPARX, Chaskey, and CHAM-64. Secur. Commun. Netw. (2020). https:\/\/doi.org\/10.1155\/2020\/4898612","DOI":"10.1155\/2020\/4898612"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-39555-5_26","volume-title":"Applied Cryptography and Network Security","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Wang, Q., Rijmen, V.: Automatic search of linear trails in ARX with applications to SPECK and Chaskey. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 485\u2013499. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_26"},{"key":"8_CR9","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 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":"8_CR10","unstructured":"McKay, K.A.: Analysis of ARX round functions in secure hash functions. Doctoral Dissertation, The George Washington University, Gelman Library (2014)"},{"key":"8_CR11","unstructured":"McKay, K.A., Vora, P.L.: Analysis of ARX functions: pseudo-linear methods for approximation, differentials, and evaluating diffusion. lAGR Gryptology ePrint Archive (2014)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-39887-5_20","volume-title":"Fast Software Encryption","author":"J Wall\u00e9n","year":"2003","unstructured":"Wall\u00e9n, J.: Linear approximations of addition modulo $$2^n$$. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 261\u2013273. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_20"}],"container-title":["Communications in Computer and Information Science","Applications and Techniques in Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-33-4706-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T01:28:15Z","timestamp":1619314095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-33-4706-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789813347052","9789813347069"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-33-4706-9_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Techniques in Information Security","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atis2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.atis2020.conferences.academy\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"24","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":"8","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":"33% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","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)"}}]}}