{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:12:23Z","timestamp":1742962343484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866525"},{"type":"electronic","value":"9783030866532"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86653-2_21","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:45:47Z","timestamp":1631223947000},"page":"287-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preliminary Analysis of Interleaving PN-Sequences"],"prefix":"10.1007","author":[{"given":"Sara D.","family":"Cardell","sequence":"first","affiliation":[]},{"given":"Amparo","family":"F\u00faster-Sabater","sequence":"additional","affiliation":[]},{"given":"Ver\u00f3nica","family":"Requena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-68351-3_4","volume-title":"New Stream Cipher Designs","author":"H Wu","year":"2008","unstructured":"Wu, H.: The stream cipher HC-128. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 39\u201347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_4"},{"key":"21_CR2","volume-title":"Fractals Everywhere","author":"M Barnsley","year":"1988","unstructured":"Barnsley, M.: Fractals Everywhere. Academic Press, Cambridge (1988)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bassham, L., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications (16 September 2010). https:\/\/tsapps.nist.gov\/publication\/get_pdf.cfm?pub_id=906762","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"21_CR4","first-page":"511","volume":"2017","author":"A Biryukov","year":"2017","unstructured":"Biryukov, A., Perrin, L.: State of the art in lightweight symmetric cryptography. IACR Cryptol. ePrint Arch. 2017, 511 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bishoi, S.K., Senapati, K., Shankar, B.: Shrinking generators based on $$\\sigma $$-LFSRs. Discret. Appl. Math. 285, 493\u2013500 (2020). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X20303346","DOI":"10.1016\/j.dam.2020.06.010"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TAES.1968.5409023","volume":"4","author":"LI Bluestein","year":"1968","unstructured":"Bluestein, L.I.: Interleaving of pseudorandom sequences for synchronization. IEEE Trans. Aerosp. Electron. Syst. AES 4(4), 551\u2013556 (1968)","journal-title":"IEEE Trans. Aerosp. Electron. Syst. AES"},{"issue":"2","key":"21_CR7","first-page":"171","volume":"41","author":"P Caballero-Gil","year":"2009","unstructured":"Caballero-Gil, P., F\u00faster-Sabater, A., Pazo-Robles, M.E.: New attack strategy for the shrinking generator. J. Res. Pract. Inf. Technol. 41(2), 171\u2013180 (2009)","journal-title":"J. Res. Pract. Inf. Technol."},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1093\/jigpal\/jzz051","volume":"28","author":"SD Cardell","year":"2020","unstructured":"Cardell, S.D., Aranha, D.F., F\u00faster-Sabater, A.: Recovering decimation-based cryptographic sequences by means of linear CAs. Logic J. IGPL 28(4), 430\u2013448 (2020)","journal-title":"Logic J. IGPL"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"2893","DOI":"10.1016\/j.procs.2015.05.454","volume":"51","author":"SD Cardell","year":"2015","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Cryptanalysing the shrinking generator. Procedia Comput. Sci. 51, 2893\u20132897 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Performance of the cryptanalysis over the shrinking generator. In: Herrero, \u00c1., Baruque, B., Sedano, J., Quinti\u00e1n, H., Corchado, E. (eds.) International Joint Conference. CISIS 2015. Advances in Intelligent Systems and Computing, vol. 369. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19713-5_10","DOI":"10.1007\/978-3-319-19713-5_10"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1515\/math-2018-0058","volume":"16","author":"SD 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), 646\u2013655 (2018)","journal-title":"Open Math."},{"issue":"687","key":"21_CR12","first-page":"1","volume":"9","author":"SD Cardell","year":"2021","unstructured":"Cardell, S.D., F\u00faster-Sabater, A., Requena, V.: Interleaving shifted versions of a PN-sequence. Mathematics 9(687), 1\u201323 (2021)","journal-title":"Mathematics"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-319-62392-4_23","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2017","author":"SD Cardell","year":"2017","unstructured":"Cardell, S.D., F\u00faster-Sabater, A.: Linear models for high-complexity sequences. In: Gervasi, O., et al. (eds.) ICCSA 2017, Part I. LNCS, vol. 10404, pp. 314\u2013324. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62392-4_23"},{"key":"21_CR14","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12850-0","volume-title":"Cryptography with Shrinking Generators","author":"S D\u00edaz Cardell","year":"2019","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"},{"key":"21_CR15","unstructured":"Coppersmith, D., Herzberg, A., Krawczyk, H.M., Kutten, S., Mansour, Y.: A shrinking generator for cryptosystems (1987). https:\/\/patents.google.com\/patent\/EP0619659A2\/en"},{"key":"21_CR16","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\u2014CRYPTO 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":"520","key":"21_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S0025557200180921","volume":"91","author":"T Crilly","year":"2007","unstructured":"Crilly, T.: Interleaving integer sequences. Math. Gaz. 91(520), 27\u201333 (2007)","journal-title":"Math. Gaz."},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11863854_15","volume-title":"Sequences and Their Applications \u2013 SETA 2006","author":"A Do\u011fanaksoy","year":"2006","unstructured":"Do\u011fanaksoy, A., G\u00f6lo\u011flu, F.: On Lempel-Ziv complexity of sequences. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 180\u2013189. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11863854_15"},{"issue":"8","key":"21_CR19","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1049\/el.2014.0568","volume":"50","author":"V Edemskiy","year":"2014","unstructured":"Edemskiy, V.: On the linear complexity of interleaved binary sequences of period 4p obtained from hall sequences or Legendre and hall sequences. Electron. Lett. 50(8), 604\u2013605 (2014)","journal-title":"Electron. Lett."},{"issue":"6","key":"21_CR20","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/MDT.2007.178","volume":"24","author":"T Eisenbarth","year":"2007","unstructured":"Eisenbarth, T., Kumar, S., Paar, C., Poschmann, A., Uhsadel, L.: A survey of lightweight-cryptography implementations. IEEE Des. Test Comput. 24(6), 522\u2013533 (2007)","journal-title":"IEEE Des. Test Comput."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44706-7_2","volume-title":"Fast Software Encryption","author":"SR Fluhrer","year":"2001","unstructured":"Fluhrer, S.R., McGrew, D.A.: Statistical analysis of the alleged RC4 keystream generator. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 19\u201330. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_2"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"475","DOI":"10.12785\/amis\/080204","volume":"8","author":"A F\u00faster-Sabater","year":"2014","unstructured":"F\u00faster-Sabater, A.: Generation of cryptographic sequences by means of difference equations. Appl. Math. Inf. Sci. 8, 475\u2013484 (2014)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"02","key":"21_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MSP.2006.49","volume":"4","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R.: Randomness in cryptography. IEEE Secur. Priv. 4(02), 64\u201367 (2006)","journal-title":"IEEE Secur. Priv."},{"key":"21_CR24","volume-title":"Shift Register-Sequences","author":"SW Golomb","year":"1982","unstructured":"Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)"},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/18.370141","volume":"41","author":"G Gong","year":"1995","unstructured":"Gong, G.: Theory and applications of $$q$$-ary interleaved sequences. IEEE Trans. Inf. Theory 41(2), 400\u2013411 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0012-365X(01)00292-8","volume":"252","author":"S Jiang","year":"2002","unstructured":"Jiang, S., Dai, Z., Gong, G.: On interleaved sequences over finite fields. Discret. Math. 252, 161\u2013178 (2002)","journal-title":"Discret. Math."},{"issue":"11","key":"21_CR27","doi-asserted-by":"publisher","first-page":"7597","DOI":"10.1109\/TIT.2011.2159575","volume":"57","author":"N Li","year":"2011","unstructured":"Li, N., Tang, X.: On the linear complexity of binary sequences of period $$4n$$ with optimal autocorrelation value\/magnitude. IEEE Trans. Inf. Theory 57(11), 7597\u20137604 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Martyn, T.: The chaos game revisited: yet another, but a trivial proof of the algorithm\u2019s correctness. Appl. Math. Lett. 25(2), 206\u2013208 (2012). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0893965911003922","DOI":"10.1016\/j.aml.2011.08.020"},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J Massey","year":"1969","unstructured":"Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Mata-Toledo, R.A., Willis, M.A.: Visualization of random sequences using the chaos game algorithm. J. Syst. Softw. 39(1), 3\u20136 (1997). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0164121296001586","DOI":"10.1016\/S0164-1212(96)00158-6"},{"issue":"2","key":"21_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00193563","volume":"5","author":"UM Maurer","year":"1992","unstructured":"Maurer, U.M.: A universal statistical test for random bit generators. J. Cryptol. 5(2), 89\u2013105 (1992). https:\/\/doi.org\/10.1007\/BF00193563","journal-title":"J. Cryptol."},{"key":"21_CR32","unstructured":"Or\u00fae, A.B., F\u00faster-Sabater, A., Fern\u00e1ndez, V., Montoya, F., Hern\u00e1ndez, L., Mart\u00edn, A.: Herramientas gr\u00e1ficas de la criptograf\u00eda ca\u00f3tica para el an\u00e1lisis de la calidad de secuencias pseudoaleatorias, p. 180\u2013185. Actas de la XIV Reuni\u00f3n Espa\u00f1ola sobre Criptolog\u00eda y Seguridad de la Informaci\u00f3n, RECSI XIV, Menorca, Illes Balears, Spain (October 2016)"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"27800","DOI":"10.1109\/ACCESS.2017.2774105","volume":"5","author":"AB Or\u00fae","year":"2017","unstructured":"Or\u00fae, A.B., Hern\u00e1ndez, L., Mart\u00edn, A., Montoya, F.: A lightweight pseudorandom number generator for securing the Internet of Things. IEEE Access 5, 27800\u201327806 (2017)","journal-title":"IEEE Access"},{"key":"21_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/b97624","volume-title":"Chaos and Fractals: New Frontiers of Science","author":"HO Peitgen","year":"2004","unstructured":"Peitgen, H.O., Jurgens, H., Saupe, D.: Chaos and Fractals: New Frontiers of Science. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/b97624"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, G., Cerdeira, H.A.: Extracting messages masked by chaos. Phys. Rev. Lett. 74, 1970\u20131973 (1995). https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.74.1970","DOI":"10.1103\/PhysRevLett.74.1970"},{"issue":"12","key":"21_CR36","doi-asserted-by":"publisher","first-page":"6398","DOI":"10.1109\/TIT.2010.2081170","volume":"56","author":"X Tang","year":"2010","unstructured":"Tang, X., Ding, C.: New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value. IEEE Trans. Inf. Theory 56(12), 6398\u20136405 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR37","unstructured":"U.S. Department of Commerce: FIPS 186, Digital signature standard. Federal Information Processing Standards Publication 186, N.I.S.T., National Technical Information Service, Springfield, Virginia (1994)"},{"issue":"15","key":"21_CR38","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1049\/iet-com.2012.0649","volume":"7","author":"H Xiong","year":"2013","unstructured":"Xiong, H., Qu, L., Li, C., Fu, S.: Linear complexity of binary sequences with interleaved structure. IET Commun. 7(15), 1688\u20131696 (2013)","journal-title":"IET Commun."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86653-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T22:51:08Z","timestamp":1673218268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86653-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866525","9783030866532"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86653-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","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":"466","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":"18","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":"29% - 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,5","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":"8","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)"}}]}}