Computer Science 1233; Advances in Cryptology: Proc. Eurocrypt '97, W. Fumy,

Ed., May 1997, pp. 239-255, Berlin: Springer-Verlag, 1997

153. J. Goli¦, A. Clark and E. Dawson, "Generalized inversion attack on nonlinear filter

generators", submitted

154. D. Gollman, "Pseudo random properties of cascade connections of clock controlled

shift registers," in Lecture Notes in Computer Science 209; Advances in Cryptology:

Proc. Eurocrypt '84, T. Beth, N. Cot, and I. Ingemarsson, Eds., Paris, France, April

9-11, 1984, pp. 93-98. Berlin: Springer-Verlag, 1985.

155. D. Gollmann. Linear Recursions of Cascaded Sequences. Contributions to General

Algebra 3, Hoelder-Pichler-Tempsky, Wien, Teubner, Stuttgart, 1985

156. D. Gollmann. Correlation analysis of cascaded sequences. December 1986. Talk

presented at 1st IMA Conference on Cryptography and Coding.

157. D. Gollman and W. G. Chambers, "Lock-in effect in cascades of clock-controlled

shift-registers," in Lecture Notes in Computer Science 330; Advances in Cryptology:

Proc. Eurocrypt '88, C. G. Günther, Ed., Davos, Switzerland, May 25-27, 1988, pp.

331-343. Berlin: Springer-Verlag, 1988.

158. D. Gollmann and W. G. Chambers, "Clock-controlled shift registers: A review," IEEE

J. Selected Areas Commun., vol. 7, pp. 525-533, May 1989.

159. D. Gollmann and W. G. Chambers, "A cryptanalysis of stepk,m-cascades.," Advances

in Cryptology: Proc. Eurocrypt '89,LNCS vol 434, J.-J.Quisquater, J.Vandevalle

Eds., Springer-Verlag, pages 680-687, 1990.

160. D. Gollmann, "Automata Theory and Cryptography", Proc. Cryptography and

Coding 1989, C.J.Mitchell (ed.), Oxford University Press, pp. 67-74, 1992

352

Áèá«è®ã°àôèÿ è èí¤åê± òå°¬èí®â

161. D. Gollmann, "Cryptanalysis of Clock Contolled Shift Registers", In R. Anderson,

editor, Fast Software Encryption - Cambridge Security Workshop, pages 121-126,

Springer-Verlag, Berlin, 1994.

162. S. W. Golomb, "Deep space range measurements," Jet Propulsion Laboratory,

Pasadena, CA Research Summary, No. 36-1, 1960.

163. S. W. Golomb, Shift Register Sequences, San Francisco: Holden Day, 1967. (and also

reprint: Aegan Park Press, 1982)

164. J.A. Gordon, "Very Simple Method to Find the Minimal Polynomial of an Arbitrary

Non-Zero Element of a Finite Field," Electronic Letters, v. 12, n. 25, 9 Dec 1976, pp.

663-664.

165. R. Gottfert and H. Niederreiter. A general lower bound for the linear complexity of

the product of shift-register sequences. In Advances in Cryptology - Eurocrypt '94,

Springer-Verlag, Berlin.

166. E. J. Groth, "Generation of binary sequences with controllable complexity," IEEE

Trans. Inform. Theory, vol. IT-17, no. 3, May 1971.

167. C. G. Günther, "On some properties of the sum of two pseudorandom sequences,"

paper presented at Eurocrypt'86, Linkoping, Sweden, May 20-22, 1986.

168. C. G. Günther, "Alternating step generators controlled by de Bruijn sequences,"

in Lecture Notes in Computer Science 304; Advances in Cryptology: Proc.

Eurocrypt' 87, D. Chaum and W. L. Price, Eds., Amsterdam, The Netherlands, April

13-15, 1987, pp. 5-14. Berlin: Springer-Verlag, 1988.

169. C. G. Günther, "A universal algorithm for homophonic coding," in Lecture Notes in

Computer Science 330; Advances in Cryptology: Proc. Eurocrypt'88, C. G. Günther,

Ed., Davos, Switzerland, May 25-27, 1988, pp. 405-414. Berlin: Springer-Verlag,

1988.

170. H.M.Gustafson, E.P.Dawson and J.Dj.Goli¦, "Randomness Measures Related to

subset occurence", in Lecture Notes in Computer Science 1029; Advances in

Cryptology: Proc. Cryptography: Policy and Algorithms, Ed Dawson, J.Golic (Eds.),

Brisbane, Queensland, Australia, July 1995, pp. 132-143. Berlin: Springer-Verlag,

1996.

171. T.H.Harris, The Theory of Branching Processes. Berlin, Springer-Verlag, 1963

172. J. Hastad and A. Shamir. The cryptographic security of truncated linearly related

variables. In Proceedings of the 17th ACM Symposium on Theory of Computing,

pages 356-362, 1985.

353

Áèá«è®ã°àôèÿ è èí¤åê± òå°¬èí®â

173. J. Hastad, B. Just, J. Lagarias and C.P. Schnorr. "Polynomial time algorithms for

finding integer relations among real numbers", SIAM J. Comput., vol. 18, pp. 859-

881, 1989.

174. T. Herlestam, "On the complexity of functions of linear shift register sequences," Int.

Symp. Inform. Theory, Les Arc, France, 1982.

175. T. Herlestam, "On functions of linear shift register sequences," in LNCS 219;

Advances in Cryptology: Eurocrypt'85, pp. 119-129. Berlin: Springer-Verlag, 1986.

176. J.J. Hopfield and D.W.Tank. Neural computation of decisions in optimization

problems, Biological Cybernetics 52: 1-25, (1985)

177. C. J. Jansen, "Investigations on nonlinear stream cipher systems: Construction and

evaluation methods", Ph.D. thesis, Eindhoven University of Technology, The

Netherlands, 1989.

178. C. J. Jansen and D.E. Boekke, "A Binary Sequence Generator Based on Ziv-Lempel

Source Coding". In J.Seberry and J.Pieprzyk, eds., Advances in Cryptology -

Auscrypt '90, pages 156-164, Springer Verlag, Berlin, 1990.

179. R.J. Jenkins, "ISAAC", In Fast Software Encryption - Third International Workshop,

Cambridge, February 1996, pp. 41-49, Springer-Verlag, Berlin, 1996

180. S.M. Jennings. A Special Class of Binary Sequences. PhD thesis, University of

London, 1980.

181. S. M. Jennings, "Multiplexed sequences: Some properties of the minimum poly-

nomial," in Lecture Notes in Computer Science 149; Cryptography: Proc. Workshop

Cryptography, T. Beth, Ed., Burg Feuerstein, Germany, March 29-April 2, 1982, pp.

189-206. Berlin: Springer-Verlag, 1983.

182. S. M. Jennings, "Autocorrelation function of the multiplexed sequence," IEE Proc.,

vol. 131, no. 2, pp. 169-172, Apr. 1984.

183. B. Kaliski, A pseudo random bit generator based on elliptic logarithms, M. Sc. thesis,

Massachusetts Institute of Technology, 1987.

184. E. L. Key, "An analysis of the structure and complexity of nonlinear binary sequence

generators," IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 732-763, Nov. 1976.

185. L.H. Khachaturian. The lower bound of the quadratic spans of de Bruijn sequences.

Designs, Codes and Cryptography, 3:29-32, 1993.

186. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, "Optimization by simulated annealing",

Science, 220 (4598):671-680, 1983.

354

Áèá«è®ã°àôèÿ è èí¤åê± òå°¬èí®â

187. K. Kjeldsen and E. Andresen, "Some randomness properties of cascaded sequences,"

IEEE Trans. Inform. Theory, vol. IT-26, pp. 227-232, March 1980.

188. A. Klapper. The vulnerability of geometric sequences based on fields of odd

characteristic. Journal of Cryptology, 7(1):33-52, 1994.