{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T17:10:04Z","timestamp":1747847404490,"version":"3.41.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319106823"},{"type":"electronic","value":"9783319106830"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10683-0_7","type":"book-chapter","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T15:54:11Z","timestamp":1427298851000},"page":"127-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers"],"prefix":"10.1007","author":[{"given":"Kalikinkar","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"issue":"2","key":"7_CR1","first-page":"198","volume":"46","author":"F.S. Annexstein","year":"1997","unstructured":"F.S. Annexstein, Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Inf. Theory 46(2), 198\u2013200 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR2","unstructured":"E.R. Berlekamp, Algebraic Coding Theory, Ch.\u20097 (McGraw-Hill, New York, 1968)"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"33","author":"A.H. Chan","year":"1982","unstructured":"A.H. Chan, R.A. Games, E.L. Key, On the complexities of de Bruijn sequences. J. Combin. Theory Ser. A 33(3) 233\u2013246 (1982)","journal-title":"J. Combin. Theory Ser. A"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"A.H. Chan, R.A. Games, J.J. Rushanan, On quadratic m-sequences, in IEEE International Symposium on Information Theory, vol. 364 (1994)","DOI":"10.1109\/ISIT.1994.394654"},{"key":"7_CR5","volume-title":"On the linear span of ideal autocorrelation sequences arising from the Segre hyperoval, in Sequences and their Applications\u2014Proceedings of SETA\u201998, Discrete Mathematics and Theoretical Computer Science","author":"A.C. Chang","year":"1999","unstructured":"A.C. Chang, S.W. Golomb, G. Gong, P.V. Kumar, On the linear span of ideal autocorrelation sequences arising from the Segre hyperoval, in Sequences and their Applications\u2014Proceedings of SETA\u201998, Discrete Mathematics and Theoretical Computer Science (Springer, London, 1999)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/18.761285","volume":"45","author":"T. Chang","year":"1999","unstructured":"T. Chang, B. Park, Y.H. Kim, I. Song, An efficient implementation of the D-homomorphism for generation of de Bruijn sequences. IEEE Trans. Inf. Theory 45(4), 1280\u20131283 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"C. De Canni\u00e9re, O. Dunkelman, M. Knez\u0300evi\u0107, KATAN and KTANTAN\u2014a family of small and efficient hardware-oriented block ciphers. in Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems, LNCS, vol.\u00a05747 (Springer, Heidelberg, 2009). pp.\u00a0272\u2013288","DOI":"10.1007\/978-3-642-04138-9_20"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.ffa.2003.09.003","volume":"10","author":"J. Dillon","year":"2004","unstructured":"J. Dillon, H. Dobbertin, New cyclic difference sets with singer parameters. Finite Fields Appl. 10(3), 342\u2013389 (2004)","journal-title":"Finite Fields Appl."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"H. Dobbertin, Kasami power functions, permutation polynomials and cyclic difference sets, in Proceedings of the NATO-A.S.I. Workshop Difference Sets, Sequences and their Correlation Properties, (Kluwer, Bad Windsheim\/Dordrecht, 1999), pp.\u00a0133\u2013158","DOI":"10.1007\/978-94-011-4459-9_6"},{"key":"7_CR10","unstructured":"E. Dubrova, A list of maximum period NLFSRs. Report 2012\/166, Cryptology ePrint Archive (2012), http:\/\/eprint.iacr.org\/2012\/166.pdf"},{"key":"7_CR11","unstructured":"eSTREAM: The ECRYPT stream cipher project. http:\/\/www.ecrypt.eu.org\/stream\/"},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TIT.1984.1056965","volume":"30","author":"T. Etzion","year":"1984","unstructured":"T. Etzion, A. Lempel, Construction of de Bruijn sequences of minimal complexity. IEEE Trans. Inf. Theory 30(5), 705\u2013709 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/jcta.1998.2950","volume":"87","author":"R. Evan","year":"1999","unstructured":"R. Evan, H.D.L. Hollman, C. Krattenthaler, Q. Xiang, Gauss sums, Jacobi sums and p-ranks of cyclic difference sets. J. Combin. Theory Ser. A, 87(1), 74\u2013119 (1999)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0097-3165(75)80007-0","volume":"19","author":"H. Fredricksen","year":"1975","unstructured":"H. Fredricksen, A class of nonlinear de Bruijn cycles. J. Combin. Theory Ser. A 19(2), 192\u2013199 (1975)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195\u2013221 (1982)","journal-title":"SIAM Rev."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0097-3165(77)90059-0","volume":"22","author":"H. Fredricksen","year":"1977","unstructured":"H. Fredricksen, I. Kessler, Lexicographic compositions and de Bruijn sequences. J. Combin. Theory Ser. A 22, 17\u201330 (1977)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"H. Fredricksen, J. Maiorana, Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math. 23(3), 207\u2013210 (1978)","journal-title":"Discrete Math."},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1109\/TIT.1983.1056764","volume":"29","author":"R.A. Games","year":"1983","unstructured":"R.A. Games, A generalized recursive construction for de Bruijn sequences. IEEE Trans. Inf. Theory 29(6), 843\u2013850 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR19","unstructured":"B.M. Gammel, R. G\u00f6ttfert, O. Kniffler, Achterbahn-128\/80 (2006), http:\/\/www.ecrypt.eu.org\/stream\/p2ciphers\/achterbahn\/achterbahn_p2.pdf"},{"key":"7_CR20","volume-title":"Shift Register Sequences","author":"S.W. Golomb","year":"1981","unstructured":"S.W. Golomb, Shift Register Sequences (Aegean Park Press, Laguna Hills, 1981)"},{"issue":"6","key":"7_CR21","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TIT.1980.1056265","volume":"26","author":"S.W. Golomb","year":"1980","unstructured":"S.W. Golomb, On the classification of balanced binary sequences of period 2 n \u2212 1. IEEE Trans. Inf. Theory, 26(6), 730\u2013732 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR22","volume-title":"Signal Design for Good Correlation: for Wireless Communication, Cryptography, and Radar","author":"S.W. Golomb","year":"2004","unstructured":"S.W. Golomb, G. Gong, Signal Design for Good Correlation: for Wireless Communication, Cryptography, and Radar (Cambridge University Press, New York, 2004)"},{"key":"7_CR23","first-page":"192","volume-title":"Randomness and representation of span n sequences, in Proceedings of the 2007 International Conference on Sequences, Subsequences, and Consequences, SSC\u201907","author":"G. Gong","year":"2007","unstructured":"G. Gong, Randomness and representation of span n sequences, in Proceedings of the 2007 International Conference on Sequences, Subsequences, and Consequences, SSC\u201907 (Springer, Heidelberg, 2007), pp.\u00a0192\u2013203"},{"issue":"1\u20133","key":"7_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0012-365X(96)00106-9","volume":"159","author":"E.R. Hauge","year":"1996","unstructured":"E.R. Hauge, T. Helleseth, De Bruijn sequences, irreducible codes and cyclotomy. Discrete Math. 159(1\u20133), 143\u2013154 (1996)","journal-title":"Discrete Math."},{"issue":"5","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"C.J.A. Jansen","year":"1991","unstructured":"C.J.A. Jansen, W.G. Franx, D.E. Boekee, An efficient algorithm for the generation of de Bruijn cycles. IEEE Trans. Inf. Theory 37(5), 1475\u20131478 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","volume":"C-19","author":"A. Lempel","year":"1970","unstructured":"A. Lempel, On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. C-19(12), 1204\u20131209 (1970)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR27","unstructured":"K. Mandal, Design and analysis of cryptographic pseudorandom number\/sequence generators with applications in RFID. Ph.D. Thesis, University of Waterloo, 2013"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"K. Mandal, G. Gong, in Cryptographically Strong de Bruijn Sequences with Large Periods, ed. by L.R. Knudsen, H. Wu SAC 2012. LNCS, vol.\u00a07707 (Springer, Heidelberg, 2012), pp.\u00a0104\u2013118","DOI":"10.1007\/978-3-642-35999-6_8"},{"key":"7_CR29","unstructured":"K. Mandal, G. Gong, Cryptographic D-morphic analysis and fast implementations of composited De Bruijn sequences. Technical Report CACR 2012\u201327, University of Waterloo (2012)"},{"key":"7_CR30","unstructured":"K. Mandal, X. Fan, G. Gong, in Warbler: A Lightweight Pseudorandom Number Generator for EPC Class 1 Gen 2 RFID Tags, ed. by N.W. Lo, Y. Li. Cryptology and Information Security Series\u2014The 2012 Workshop on RFID and IoT Security (RFIDsec\u201912 Asia), vol.\u00a08 (IOS Press, Amsterdam, 2012), pp.\u00a073\u201384"},{"issue":"1","key":"7_CR31","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"J.L. Massey, Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0012-365X(94)90291-7","volume":"126","author":"G.L. Mayhew","year":"1994","unstructured":"G.L. Mayhew, Weight class distributions of de Bruijn sequences. Discrete Math. 126, 425\u2013429 (1994)","journal-title":"Discrete Math."},{"issue":"11","key":"7_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0898-1221(00)00109-7","volume":"39","author":"G.L. Mayhew","year":"2000","unstructured":"G.L. Mayhew, Clues to the hidden nature of de Bruijn sequences. Comput. Math. Appl., 39(11), 57\u201365 (2000)","journal-title":"Comput. Math. Appl."},{"issue":"5","key":"7_CR34","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/18.57220","volume":"36","author":"G.L. Mayhew","year":"1990","unstructured":"G.L. Mayhew, S.W. Golomb, Linear Spans of modified de Bruijn sequences. IEEE Trans. Inf. Theory 36(5), 1166\u20131167 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/0196-8858(92)90021-N","volume":"13","author":"G.L. Mayhew","year":"1992","unstructured":"G.L. Mayhew, S.W. Golomb, Characterizations of generators for modified de Bruijn sequences. Adv. Appl. Math. 13, 454\u2013461 (1992)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"7_CR36","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0019-9958(79)90708-3","volume":"43","author":"J. Mykkeltveit","year":"1979","unstructured":"J. Mykkeltveit, M.-K. Siu, P. Tong, On the cycle structure of some nonlinear shift register sequences. Inf. Control 43(2), 202\u2013215 (1979)","journal-title":"Inf. Control"},{"key":"7_CR37","volume-title":"Binary nonlinear feedback shift register sequence generator using the trace function","author":"J.L.-F. Ng","year":"2005","unstructured":"J.L.-F. Ng, Binary nonlinear feedback shift register sequence generator using the trace function, Master\u2019s Thesis, University of Waterloo, 2005"},{"issue":"2","key":"7_CR38","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/18.661528","volume":"44","author":"J.S. No","year":"1998","unstructured":"J.S. No, S.W. Golomb, G. Gong, H.K. Lee, P. Gaal, New binary pseudorandom sequences of period 2 n \u2212 1 with ideal autocorrelation. IEEE Trans. Inf. Theory 44(2), 814\u2013817 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR39","unstructured":"T. Rachwalik, J. Szmidt, R. Wicik, J. Zablocki, Generation of nonlinear feedback shift registers with special-purpose hardware. Cryptology ePrint Archive, Report 2012\/314 (2012), http:\/\/eprint.iacr.org\/"},{"key":"7_CR40","first-page":"357","volume-title":"Construction of m-ary de Bruijn sequences (extended abstract), in Advances in Cryptology\u2014AUSCRYPT\u201992, LNCS","author":"J.-H. Yang","year":"1993","unstructured":"J.-H. Yang, Z.-D. Dai, Construction of m-ary de Bruijn sequences (extended abstract), in Advances in Cryptology\u2014AUSCRYPT\u201992, LNCS (Springer, Heidelberg, 1993), pp.\u00a0357\u2013363"}],"container-title":["Open Problems in Mathematics and Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10683-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T16:28:43Z","timestamp":1747844923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10683-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319106823","9783319106830"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10683-0_7","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}