{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:48:27Z","timestamp":1772052507774,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319936970","type":"print"},{"value":"9783319936987","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_50","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"653-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The t-Modified Self-Shrinking Generator"],"prefix":"10.1007","author":[{"given":"Sara D.","family":"Cardell","sequence":"first","affiliation":[]},{"given":"Amparo","family":"F\u00faster-Sabater","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"50_CR1","volume-title":"Shift Register-Sequences","author":"SW Golomb","year":"1982","unstructured":"Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)"},{"issue":"1","key":"50_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/jigpal\/jzu039","volume":"23","author":"O Delgado-Mohatar","year":"2015","unstructured":"Delgado-Mohatar, O., F\u00faster-Sabater, A.: Software implementation of cryptographic sequence generators over extended fields. Logic J. IGPL 23(1), 73\u201387 (2015)","journal-title":"Logic J. IGPL"},{"key":"50_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04101-3","volume-title":"Understanding Cryptography","author":"C Paar","year":"2010","unstructured":"Paar, C., Pelzl, J.: Understanding Cryptography. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-04101-3"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-48329-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D., Krawczyk, H., Mansour, Y.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22\u201339. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_3"},{"issue":"4","key":"50_CR5","doi-asserted-by":"publisher","first-page":"797","DOI":"10.3934\/amc.2016041","volume":"10","author":"SD Cardell","year":"2016","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Modelling the shrinking generator in terms of linear CA. Adv. Math. Commun. 10(4), 797\u2013809 (2016)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"50_CR6","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1515\/math-2018-0058","volume":"16","author":"Sara D. Cardell","year":"2018","unstructured":"Cardell, S.D., F\u00faster-Sabater, A., Ranea, A.: Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator. Open Math. 16(1), April 2018","journal-title":"Open Mathematics"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BFb0053436","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1994","author":"W Meier","year":"1995","unstructured":"Meier, W., Staffelbach, O.: The self-shrinking generator. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 205\u2013214. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053436"},{"issue":"5","key":"50_CR8","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.compeleceng.2010.02.004","volume":"36","author":"A Kanso","year":"2010","unstructured":"Kanso, A.: Modified self-shrinking generator. Comput. Electr. Eng. 36(5), 993\u20131001 (2010)","journal-title":"Comput. Electr. Eng."},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-48000-6_6","volume-title":"Advances in Cryptology - ASIACRYPT 1999","author":"SR Blackburn","year":"1999","unstructured":"Blackburn, S.R., Galbraith, S.: Cryptanalysis of two cryptosystems based on group actions. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 52\u201361. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_6"},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.procs.2016.05.346","volume":"80","author":"SD Cardell","year":"2016","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Recovering the MSS-sequence via CA. Proc. Comput. Sci. 80, 599\u2013606 (2016)","journal-title":"Proc. Comput. Sci."},{"issue":"4","key":"50_CR11","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.2004.825256","volume":"50","author":"Y Hu","year":"2004","unstructured":"Hu, Y., Xiao, G.: Generalized self-shrinking generator. IEEE Trans. Inf. Theory 50(4), 714\u2013719 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"50_CR12","doi-asserted-by":"publisher","first-page":"2052","DOI":"10.1109\/TIT.2006.872969","volume":"52","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Lei, J.G., Zhang, S.P.: A new family of almost difference sets and some necessary conditions. IEEE Trans. Inf. Theory 52(5), 2052\u20132061 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ffa.2017.06.010","volume":"47","author":"SD Cardell","year":"2017","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Discrete linear models for the generalized self-shrunken sequences. Finite Fields Appl. 47, 222\u2013241 (2017)","journal-title":"Finite Fields Appl."}],"updated-by":[{"DOI":"10.1007\/978-3-319-93698-7_55","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000}}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:08:10Z","timestamp":1654906090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_50","relation":{"erratum":[{"id-type":"doi","id":"10.1007\/978-3-319-93698-7_55","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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","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":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%.  A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}