{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:23:10Z","timestamp":1784211790309,"version":"3.55.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,8]],"date-time":"2014-03-08T00:00:00Z","timestamp":1394236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10623-014-9947-3","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T02:14:21Z","timestamp":1394158461000},"page":"469-486","source":"Crossref","is-referenced-by-count":13,"title":["Generation of full cycles by a composition of NLFSRs"],"prefix":"10.1007","volume":"73","author":[{"given":"Elena","family":"Dubrova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"key":"9947_CR1","unstructured":"Annexstein F.S.: Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Comput. 46, 198\u2013200 (1997)."},{"key":"9947_CR2","doi-asserted-by":"crossref","unstructured":"Brayton R.K., McMullen C., Hatchel G., Sangiovanni-Vincentelli A.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer, Norwell (1984).","DOI":"10.1007\/978-1-4613-2821-6"},{"key":"9947_CR3","unstructured":"Chang T., Park B., Kim Y.H., Song I.: An efficient implementation of the D-homomorphism for generation of de Bruijn sequences. IEEE Trans. Inf. Theory 45, 1280\u20131283 (1999)."},{"key":"9947_CR4","doi-asserted-by":"crossref","unstructured":"Cusick T.W., St\u01cenic\u01ce P.: Cryptographic Boolean Functions and Applications. Academic Press, San Diego (2009).","DOI":"10.1016\/B978-0-12-374890-4.00009-4"},{"key":"9947_CR5","unstructured":"David R.: Random Testing of Digital Circuits. Marcel Dekker, New York (1998)."},{"key":"9947_CR6","unstructured":"de Bruijn N.G.: A combinatorial problem. Ned. Akad. Wet. 49, 758\u2013746 (1946)."},{"key":"9947_CR7","unstructured":"Dubrova E.: A list of maximum-period NLFSRs. Cryptology ePrint Archive, Report 2012\/166. http:\/\/eprint.iacr.org\/2012\/166 (2012)."},{"key":"9947_CR8","unstructured":"Dubrova E.: A scalable method for constructing Galois NLFSRs with period $$2^n-1$$ 2 n - 1 using cross-join pairs. IEEE Trans. Inf. Theory 1(59), 703\u2013709 (2013)."},{"key":"9947_CR9","doi-asserted-by":"crossref","unstructured":"Dubrova E., Teslenko M.: Compositional properties of random Boolean networks. Phys. Rev. E 71, 056116 (2005).","DOI":"10.1103\/PhysRevE.71.056116"},{"key":"9947_CR10","unstructured":"Dubrova E., Teslenko M., Tenhunen H.: On analysis and synthesis of $$(n, k)$$ ( n , k ) -non-linear feedback shift registers. In: Design and Test in Europe, pp. 133\u2013137 (2008)."},{"key":"9947_CR11","unstructured":"Etzion T., Lempel A.: Algorithms for the generation of full-length shift register sequences. IEEE Trans. Inf. Theory 3, 480\u2013484 (1984)."},{"key":"9947_CR12","unstructured":"Fredricksen H.M.: Disjoint cycles from de Bruijn graph. Technical Report 225, USCEE (1968)."},{"key":"9947_CR13","doi-asserted-by":"crossref","unstructured":"Fredricksen H.: A class of nonlinear de Bruijn cycles. J. Comb. Theory 19(A), 192\u2013199 (1975).","DOI":"10.1016\/S0097-3165(75)80007-0"},{"key":"9947_CR14","doi-asserted-by":"crossref","unstructured":"Fredricksen H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195\u2013221 (1982).","DOI":"10.1137\/1024041"},{"key":"9947_CR15","unstructured":"Gammel B., G\u00f6ttfert R., Kniffler O.: Achterbahn-128\/80: Design and analysis. In: SASC\u20192007: Workshop Record of The State of the Art of Stream Ciphers, pp. 152\u2013165 (2007)."},{"key":"9947_CR16","doi-asserted-by":"crossref","unstructured":"Gammel B.M., G\u00f6ttfert R., Kniffler O.: An NLFSR-based stream cipher. In: Proceedings of IEEE International Symposium on Circuits and Systems (2006).","DOI":"10.1109\/ISCAS.2006.1693235"},{"key":"9947_CR17","unstructured":"Gittins B., Landman H.A., O\u2019Neil S., Kelson R.: A presentation on VEST hardware performance, chip area measurements, power consumption estimates and benchmarking in relation to the AES, SHA-256 and SHA-512. Cryptology ePrint Archive, Report 2005\/415. http:\/\/eprint.iacr.org\/ (2005)."},{"key":"9947_CR18","unstructured":"Golomb S.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)."},{"key":"9947_CR19","unstructured":"Helleseth T., Kl\u00f8ve T.: The number of cross-join pairs in maximum length linear sequences. IEEE Trans. Inf. Theory 31, 1731\u20131733 (1991)."},{"key":"9947_CR20","unstructured":"Jansen C.J.A.: Investigations on nonlinear streamcipher systems: construction and evaluation methods. Ph.D. Thesis, Technical University of Delft (1989)."},{"key":"9947_CR21","unstructured":"Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15, 122\u2013127 (1969)."},{"key":"9947_CR22","unstructured":"Schneier B.: Applied Cryptography : Protocols, Algorithms, and Source Code in C, 2nd ed. Wiley, New York (1995)."},{"key":"9947_CR23","doi-asserted-by":"crossref","unstructured":"Zeng K., Yang C., Wei D., Rao T.R.N.: Pseudo-random bit generators in stream-cipher cryptography. Computer 24(2), 8\u201317 (1991).","DOI":"10.1109\/2.67207"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9947-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9947-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9947-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T06:09:29Z","timestamp":1565244569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9947-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,8]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9947"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9947-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,8]]}}}