{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:48:28Z","timestamp":1772052508773,"version":"3.50.1"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031087530","type":"print"},{"value":"9783031087547","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08754-7_19","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T07:06:09Z","timestamp":1655795169000},"page":"139-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hadamard Matrix-Based Algorithm to\u00a0Evaluate the\u00a0Strength of\u00a0Binary Sequences"],"prefix":"10.1007","author":[{"given":"Amparo","family":"F\u00faster-Sabater","sequence":"first","affiliation":[]},{"given":"Ver\u00f3nica","family":"Requena","sequence":"additional","affiliation":[]},{"given":"Sara D.","family":"Cardell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Binomial representation of cryptographic binary sequences and its relation to cellular automata. Complexity 1, 1\u201313 (2019). https:\/\/doi.org\/10.1155\/2019\/2108014","DOI":"10.1155\/2019\/2108014"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"D\u00edaz Cardell, S., F\u00faster-Sabater, A.: Cryptography with Shrinking Generators. SM, Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12850-0","DOI":"10.1007\/978-3-030-12850-0"},{"issue":"55","key":"19_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/MCOM.2017.1700154","volume":"2017","author":"WL Chin","year":"2017","unstructured":"Chin, W.L., Li, W., Chen, H.H.: Energy big data security threats in IoT-based smart grid communications. IEEE Commun. Mag. 2017(55), 70\u201375 (2017)","journal-title":"IEEE Commun. Mag."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"F\u00faster-Sabater, A., Cardell, S.D.: Linear complexity of generalized sequences by comparison of PN-sequences. Revista de la Real Academia de Ciencias Exactas, F\u00edsicas y Naturales (RACSAM) 114(4), 79\u201397 (2020)","DOI":"10.1007\/s13398-020-00807-5"},{"key":"19_CR5","unstructured":"Golomb, S.W.: Shift Register-Sequences, 2nd edn. Aegean Park Press, Laguna Hill (1982)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.2004.825256","volume":"50","author":"H Yupu","year":"2004","unstructured":"Yupu, H., Xiao, G.: Generalized self-shrinking generator. IEEE Trans. Inf. Theory 50(4), 714\u2013719 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.3390\/computers9040100","volume":"9","author":"JL Martin-Navarro","year":"2020","unstructured":"Martin-Navarro, J.L., F\u00faster-Sabater, A.: Folding-BSD algorithm for binary sequence decomposition. Computers 9(4), 100 (2020). https:\/\/doi.org\/10.3390\/computers9040100","journal-title":"Computers"},{"key":"19_CR8","series-title":"Modeling and Optimization in Science and Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30913-2","volume-title":"Internet of Things (IoT) in 5G Mobile Technologies","year":"2016","unstructured":"Mavromoustakis, C.X., Mastorakis, G., Batalla, J.M. (eds.): Internet of Things (IoT) in 5G Mobile Technologies. MOST, vol. 8. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30913-2"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR10","unstructured":"NIST. Lightweight Cryptography Project. https:\/\/csrc.nist.gov\/Projects\/Lightweight-Cryptography. Accessed 28 Mar 2022"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08754-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T07:28:54Z","timestamp":1655796534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08754-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087530","9783031087547"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08754-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","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":"474","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":"175","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":"78","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":"37% - 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":"2.8","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)"}}]}}