{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:58:31Z","timestamp":1761058711706},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671855"},{"type":"electronic","value":"9783540465133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46513-8_3","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T10:47:23Z","timestamp":1186051643000},"page":"34-48","source":"Crossref","is-referenced-by-count":24,"title":["Elliptic Curve Pseudorandom Sequence Generators"],"prefix":"10.1007","author":[{"given":"Guang","family":"Gong","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Berson","sequence":"additional","affiliation":[]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-39757-4_9","volume":"209","author":"T. Beth","year":"1985","unstructured":"T. Beth and F. Piper, The stop-and-go generator, Advances in Cryptology, Proc. of EUROCRYPT\u201984, vol. 209, Springer-Verlag, 1985, pp. 88\u201392.","journal-title":"Advances in Cryptology, Proc. of EUROCRYPT\u201984"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal of Computing\n                           13(4), pp. 850\u2013864, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR3","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"N.G. de Bruijn, A combinatorial problem, Kononklijke Nederlands Akademi van Wetenchappen, Proc., vol. 49, Pr. 2, 1946, pp. 758\u2013764.","journal-title":"Kononklijke Nederlands Akademi van Wetenchappen, Proc."},{"key":"3_CR4","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 and E.L. Key, On the complexities of de Bruijn sequences, J. Combin. Theory, vol. 33, pp. 233\u2013246, Nov. 1982.","journal-title":"J. Combin. Theory"},{"key":"3_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-48329-2_3","volume-title":"Advances in Cryptology-Crypt\u201993","author":"D. Coppersmith","year":"1994","unstructured":"D. Coppersmith, H. Krawczys and Y. Mansour, The shrinking generator, Advances in Cryptology-Crypt\u201993, Lecture Notes in Computer Science, vol. 773, Springer-Verlag, 1994, pp. 22\u201339."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredrickson","year":"1982","unstructured":"H. Fredrickson, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev., Vol. 24, pp. 195\u2013229, Apr. 1982.","journal-title":"SIAM Rev."},{"issue":"6","key":"3_CR7","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1109\/TIT.1983.1056764","volume":"IT-29","author":"R.A. Games","year":"1983","unstructured":"R.A. Games, A generalized recursive construction for de Bruijn sequences, IEEE Trans-on Inform. Theory vol. IT-29, No. 6, Nov. 1983, pp. 843\u2013850.","journal-title":"IEEE Trans-on Inform. Theory"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"R. Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Trans. on Inform. Theory, January 1968, pp. 154\u2013156.","DOI":"10.1109\/TIT.1968.1054106"},{"key":"3_CR9","unstructured":"S.W. Golomb, Shift Register Sequences, Revised Edition, Aegean Park Press, 1982, pp. 39."},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/18.57220","volume":"IT-36","author":"G.L. Mayhew","year":"1990","unstructured":"G.L. Mayhew and S.W. Golomb, Linear spans of modified de Bruijn sequences, IEEE Trans. Inform. Theory, vol. IT-36, No. 5, September 1990, pp. 1166\u20131167.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR11","volume-title":"An Analysis and Synthesis of Phases and Linear Complexity of Nonlinear Feed-forward Sequences","author":"G. Gong","year":"1990","unstructured":"G. Gong, An Analysis and Synthesis of Phases and Linear Complexity of Nonlinear Feed-forward Sequences, Ph. D. dissertation, Institute of Information Systems, Univ. of Electronic Sci. & Tech. of China, Chengdu, Sichuan, China, 1990."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/18.370141","volume":"IT-41","author":"G. Gong","year":"1995","unstructured":"G. Gong, Theory and applications of q-ary interleaved sequences, IEEE Trans. on Inform. Theory, vol. IT-41, No. 2, March 1995, pp. 400\u2013411.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"3_CR13","unstructured":"G. Gong, T.A. Berson, and D.R. Stinson, Elliptic curve pseudorandom sequence generators, Technical Report, University of Waterloo, December 1998, \n                    http:\/\/www.cacr.math.uwaterloo.ca\n                    \n                  ."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TIT.1971.1054618","volume":"IT-17","author":"E.J. Groth","year":"1971","unstructured":"E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. on Inform. Theory vol. IT-17, No. 3, May 1971, pp. 288\u2013296.","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TIT.1976.1055626","volume":"IT-22","author":"E.L. Key","year":"1976","unstructured":"E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Trans. on Inform. Theory vol. IT-22, No. 6, November 1976, pp. 732\u2013736.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","first-page":"84","volume-title":"Advances in Cryptology-Crypto\u201986","author":"B. Kaliski Jr.","year":"1986","unstructured":"Jr. B. Kaliski, A pseudo-random bit generator based on elliptic logarithms, Advances in Cryptology-Crypto\u201986, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1986. pp. 84\u2013103."},{"key":"3_CR17","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York, 1977."},{"key":"3_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-68697-5_27","volume-title":"Advances in Cryptology-Crypto\u201996","author":"J.L. Massey","year":"1996","unstructured":"J.L. Massey and S. Serconek, The linear complexity of periodic sequences: a general theory, Advances in Cryptology-Crypto\u201996, Lecture Notes in Computer Science, vol. 1109, Springer-Verlag, Berlin, 1996. pp. 358\u2013372."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00203817","volume":"6","author":"A.J. Menezes","year":"1993","unstructured":"A.J. Menezes and S.A. Vanstone, Elliptic curve cryptosystems and their implementation, Journal of Cryptology, 6 (1993), pp.209\u2013224.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"3_CR21","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, and P. Gaal, New binary pseudorandom sequences of period 2n \u2014 1 with ideal autocorrelation, IEEE Trans. on Inform. Theory, vol. 44, No. 2, March 1998, pp.814\u2013817.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"3_CR22","first-page":"300","volume":"8","author":"I.R. Reed","year":"1960","unstructured":"I.R. Reed and G. Solomon, Polynomial codes over certain finite fields, J. SIAM, 8 (1960), pp. 300\u2013304.","journal-title":"J. SIAM"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1987.1057268","volume":"IT-33","author":"R.A. Rueppel","year":"1987","unstructured":"R.A. Rueppel, Products of linear recurring sequences with maximum complexity, IEEE Trans. on Inform. Theory vol. IT-33, No. 1, January 1987, pp. 124\u2013131.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"D.V. Sarwate, Optimum PN sequences for CDMA systems, Proceedings of IEEE Third International Symposium on Spread Spectrum Techniques and Applications (IEEE ISSSTA\u201994), pp. 27\u201335.","DOI":"10.1109\/ISSSTA.1994.379619"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"IT-30","author":"T. Siegenthaler","year":"1984","unstructured":"T. Siegenthaler, Correlation-immunity of nonlinear combing functions for cryptographic applications, IEEE Trans. Inform. Theory, vol. IT-30, Sep. 1984, pp. 776\u2013780.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR26","unstructured":"Andrew C. Yao, Theory and applications of trapdoor functions, 23rd Annual Symposium of Foundations of Computer Science, pp. 80\u201391."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"D.V. Sarwate and M.B. Pursley, Cross correlation properties of pseudo-random and related sequences, Proc. of the IEEE, vol. 68, No. 5, May 1980.","DOI":"10.1109\/PROC.1980.11697"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46513-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:58:10Z","timestamp":1550440690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46513-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671855","9783540465133"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-46513-8_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}