Elliptic curve pseudorandom sequence generators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1758, Issue , 2000, Pages 34-48

  Gong, Guang ^a   Berson, Thomas A ^b   Stinson, Douglas R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Anagram Laboratories   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; PUBLIC KEY CRYPTOGRAPHY;

ELLIPTIC CURVE; LINEAR SPAN; LOWER BOUNDS; NEW APPROACHES; PSEUDO RANDOM; PSEUDORANDOM SEQUENCES; PUBLIC KEY CRYPTOSYSTEMS; TRACE FUNCTIONS;

BINARY SEQUENCES;

EID: 84944051734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46513-8_3     Document Type: Conference Paper

References (27)

1. T. Beth and F. Piper, The stop-and-go generator, Advances in Cryptology, Proc. Of EUROCRYPT'84, vol. 209, Springer-Verlag, 1985, pp. 88-92.
2. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal of Computing 13(4), pp. 850-864, 1984.
3. N.G. de Bruijn, A combinatorial problem, Kononklijke Nederlands Akademi van Wetenchappen, Proc., vol. 49, Pr. 2, 1946, pp. 758-764.
4. A.H. Chan, R.A. Games and E.L. Key, On the complexities of de Bruijn sequences, J. Combin. Theory, vol. 33, pp. 233-246, Nov. 1982.
5. D. Coppersmith, H. Krawczys and Y. Mansour, The shrinking generator, Advances in Cryptology-Crypt'93, Lecture Notes in Computer Science, vol. 773, Springer- Verlag, 1994, pp. 22-39.
6. H. Fredrickson, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev., Vol. 24, pp. 195-229, Apr. 1982.
7. 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-850.
8. R. Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Trans. on Inform. Theory, January 1968, pp. 154-156.
9. S.W. Golomb, Shift Register Sequences, Revised Edition, Aegean Park Press, 1982, pp. 39.
10. 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-1167.
11. G. Gong, An Analysis and Synthesis of Phases and Linear Complexity of Nonlin- ear Feed-forward Sequences, Ph. D. dissertation, Institute of Information Systems, Univ. of Electronic Sci. & Tech. of China, Chengdu, Sichuan, China, 1990.
12. G. Gong, Theory and applications of q−ary interleaved sequences, IEEE Trans. on Inform. Theory, vol. IT-41, No. 2, March 1995, pp. 400-411.
13. G. Gong, T.A. Berson, and D.R. Stinson, Elliptic curve pseudorandom se- quence generators, Technical Report, University of Waterloo, December 1998, http://www.cacr.math.uwaterloo.ca.
14. E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. on Inform. Theory vol. IT-17, No. 3, May 1971, pp. 288-296.
15. 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-736.
16. B. Kaliski, A pseudo-random bit generator based on elliptic logarithms, Ad- vances in Cryptology-Crypto'86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1986. pp. 84-103.
17. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York, 1977.
18. J.L. Massey and S. Serconek, The linear complexity of periodic sequences: a general theory, Advances in Cryptology-Crypto'96, Lecture Notes in Computer Science, vol. 1109, Springer-Verlag, Berlin, 1996. pp. 358-372.
19. A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Pub- lishers, 1993.
20. Vanstone, Elliptic curve cryptosystems and their imple- mentation, Journal of Cryptology, 6(1993), pp.209-224.
21. J.S. No, S.W. Golomb, G. Gong, H.K. Lee, and P. Gaal, New binary pseudo- random sequences of period 2n − 1 with ideal autocorrelation, IEEE Trans. On Inform. Theory, vol. 44, No. 2, March 1998, pp.814-817.
22. I.R. Reed and G. Solomon, Polynomial codes over certain finite fields, J. SIAM, 8(1960), pp. 300-304.
23. 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-131.
24. D.V. Sarwate, Optimum PN sequences for CDMA systems, Proceedings of IEEE Third International Symposium on Spread Spectrum Techniques and Applications (IEEE ISSSTA'94), pp. 27-35.
25. T. Siegenthaler, Correlation-immunity of nonlinear combing functions for cryp- tographic applications, IEEE Trans. Inform. Theory, vol. IT-30, Sep. 1984, pp. 776-780.
26. Andrew C. Yao, Theory and applications of trapdoor functions, 23rd Annual Symposium of Foundations of Computer Science, pp. 80-91.
27. 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.