References

1

D. Andelman and J. Reeds. On the cryptanalysis of rotor machines and substitution-permutation networks. IEEE Transactions on Information Theory, IT-28(4), 1982.

2

D. Bahler and J. King. An implementation of probabilistic relaxation in the cryptanalysis of simple substitution systems. Cryptologia, 16(2), 1992.

3

J. E. Baker. Adaptive selection methods for genetic algorithms. In Grefenstette [33].

4

J. E. Baker. Reducing the bias and inefficiency in the selection algorithm. In Grefenstette [34].

5

V. Barnett. Comparative Statistical Inference. John Wiley & Sons, 1985.

6

L.E. Baum, T. Petrie, G. Soules, and N. Weiss. A maximization technique in the statistical analysis of probabilistic functions of markov chains. Annals of Mathematical Statistics, 41(1), 1970.

7

R. K. Belew and L. B. Booker, editors. Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kauffmann, 1991.

8

E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1), 1991.

9

E. F. Brickell. The cryptanalysis of knapsack cryptosystems. In R. D. Ringeisen and F. S. Roberts, editors, Applications of Discrete Mathematics. SIAM, 1988.

10

L. Brown, J. Pieprzyk, and J. Seberry. LOKI - a cryptographic primitive for authentication and secrecy applications. In Advances in Cryptography - AUSCRYPT'90. Springer-Verlag, 1990.

11

J. Carrol and S. Martin. The automated cryptanalysis of substitution ciphers. Cryptologia, 10(4), 1986.

12

B. Chor and R. L. Rivest. A knapsack type public key cryptosystem based on arithmetic in finite fields. In G. R. Blakley and D. Chaum, editors, Advances in Cryptology - Proceedings of CRYPTO'84. Springer-Verlag, 1985.

13

L. J. Cohen. An Introduction to the Philosophy of Induction and Probability. Clarendon, 1989.

14

I. Damgård and Ivan Bjerre. A design principle for hash functions. In G. Brassard, editor, CRYPTO'89, pages 416-427. Springer, 1990. Lecture Notes in Computer Science No. 435.

15

L. Davis. Applying adaptive algorithms to epistatic domains. In Proceedings of International Conference on Artificial Intelligence, 1985.

16

B. De Finetti. Probability, Induction and Statistics: The Art of Guessing. John Wiley & Sons, 1972.

17

A. Deavours and L. Kruh. Machine Cryptography and Modern Cryptanalysis. Artech House, 1985.

18

K. A. DeJong. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan, 1975.

19

Y. Desmedt. What happened with knapsack cryptographic schemes. Performance Limits in Communication, Theory and Practice, 142, 1988.

20

W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6), 1976.

21

T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4), 1985.

22

R. Spillman et al. Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers. Cryptologia, 17(1), 1993.

23

H. Fang, P. Cross, and D. Corne. A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In Forrest [24].

24

S. Forrest, editor. Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kauffmann, 1993.

25

B. R. Fox and M. B. McMahon. Genetic operators for sequencing problems. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann, 1991.

26

R. Ganesan and A. Sherman. Statistical techniques for language recognition: An empirical study using real an simulated english. Cryptologia, 18(4), 1994.

27

D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.

28

D. Goldberg and R. Lingle. Alleles, loci, and the Travelling Salesman Problem. In Grefenstette [33].

29

S. Goldwasser and S. Macali. Probabilistic encryption and how to play mental poker keeping secret all partial information. In Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982.

30

S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer System Sciences, 28(5), 1984.

31

S. W. Golomb. Shift Register Sequences. Aegean Park Press, 1982.

32

J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht. Genetic algorithms for the Travelling Salesman Problem. In Grefenstette [33].

33

J. J. Grefenstette, editor. Proceedings of the International Conference on Genetic Algorithms and their Applications. Lawrence Earlbaum Associates, 1985.

34

J. J. Grefenstette, editor. Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Earlbaum Associates, 1987.

35

A. Hodges. Alan Turing: The Enigma. Vintage, 1983.

36

J. H. Holland. Adaption in Natural and Artificial Systems. the University of Michigan Press, 1975.

37

T. Jakobsen. A fast method for cryptanalysis of substitution ciphers. Cryptologia, 19(3), 1995.

38

D. Kahn. The Codebreakers. Sphere Books Limited, 1973.

39

A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith. Fast sequential and parallel implementation of genetic algorithms using the GAmeter toolkit. In R.F. Albrecht, C.R. Reeves, and N.C. Steele, editors, Proceedings of the Int. Conf. on Artificial Neural Nets and Genetic Algorithms. Springer Verlang, 1993.

40

A. Kapsalis and G.D. Smith. The GAmeter toolkit manual. School of information systems, computing science technical report sys-c92-01, University of East Anglia, 1992.

41

J. C. King. An algorithm for the complete automated cryptanalysis of periodic polyalphabetic substitution ciphers. Cryptologia, 18(4), 1994.

42

A. Klapper and M. Goresky. 2-adic shift registers. In Fast Software Encryption, Cambridge Security Workshop Proceedings. Springer-Verlag, 1994.

43

D. Knuth. The Art of Computer Programming: Volume 2, Seminumerical Algorithms. Addison-Wesley, 1981.

44

D. Knuth. Deciphering a linear congruential encryption. IEEE Transactions on Information Theory, IT-31(1), 1985.

45

Alan G. Konheim. Cryptography:A Primer. John Wiley & Sons, 1981.

46

S. Kullback. Statistical Methods in Cryptanalysis. Aegean Park Press, 1976.

47

J. R. Kyburg and H. E. Smokler. Studies in Subjective Probability. John Wiley & Sons, 1964.

48

X. Lai. On the Design and Securit of Block Ciphers. Hartung-Goree Verlag Konstanz, 1992.

49

X. Lai and J. L. Massey. A proposal for a new block encryption standard. In Advances in Cryptology - EUROCRYPT'90. Springer-Verlag, 1991.

50

P. L'Ecuyer. Random numbers for simulation. Communications of the ACM, 33(10), 1990.

51

R. Lidl and H. Niederreiter. Introduction to Finite Fields and Their Applications. Cambridge University Press, 1986.

52

C. H. Lin, C. C. Chang, and R. C. T. Lee. A new public-key cipher system based upon the diophantine equations. IEEE Transactions on Computers, 44(1), 1995.

53

D. V. Lindley. Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press, 1965.

54

J. W. Mann, A. Kapsalis, and G. D. Smith. The GAmeter toolkit. In V. J. Rayward-Smith, editor, Applications of Modern Heuristic Methods. Alfred Waller, 1995.

55

S. Martello and P. Toth. Knapsack Problems. John Wiley & Sons, 1990.

56

R.A.J. Mathews. The use of genetic algorithms in cryptanalysis. Cryptologia, 17(4), 1993.

57

H. Muhlenbein. Parallel genetic algorithms, population genetics and combinatorial optimization. In Schaffer [69].

58

National Bureau of Standards. Data Encryption Standard. U.S. Department of Commerce,FIPS Pub 46, 1977.

59

I. Oliver, D. Smith, and J. Holland. A study of permutation crossover operators on the travelling salesman problem. In Grefenstette [34].

60

K. Pearson. On a criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can reasonably supposed to have arisen from random sampling. Phil. Mag., 50(5), 1900.

61

S. Peleg and A. Rosenfeld. Breaking substitution ciphers using a relaxation algorithm. Communications of the ACM, 22(11), 1979.

62

P. W. Poon and J. N. Carter. Genetic algorithm crossover operators for ordering applications. Computers Operations Research, 22(1), 1995.

63

S. J. Press. Bayesian Statistics: Principles, Models and Applications. Rinehart and Winston, 1989.

64

Shamir R. Rivest, A and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Commumnications of the ACM, 21(2), 1978.

65

N. J. Radcliffe. Forma analysis and random respectful recombination. In Belew and Booker [7].

66

C. R. Reeves. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, 1993.

67

T. Ritter. The efficient generation of cryptographic confusion sequences. Cryptologia, 15(2), 1991.

68

L. J. Savage. The Foundations of Statistical Inference: A Discussion. Methuen, 1962.

69

J. D. Schaffer, editor. Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kauffmann, 1989.

70

B. Schneier. Applied Cryptography. John Wiley & Sons, 1995.

71

A. Shamir. A polynomial-time algorithm for breaking the basic merkle-hellman cryptosystem. IEE Transactions on Information Theory, IT-30(5), 1984.

72

C. E. Shannon. Communication theory of secrecy systems. Bell. System Technical Journal, 28, 1949.

73

A. Shimizu and S. Miyaguchi. Fast data encryption algorithm FEAL. In Advances in Cryptology - EUROCRYPT'87. Springer-Verlag, 1988.

74

G. D. Smith. Economic applications of genetic algorithms. In V. J. Rayward-Smith, editor, Applications of Modern Heuristic Methods, pages 71-90. Alfred Waller, 1995.

75

R. Spillman. Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia, 17(1), 1993.

76

T. Starkweather, S. McDaniel, K. Mathias, and D. Whitely. A comparison of genetic sequencing operators. In Belew and Booker [7].

77

A. Stuart and J. K. Ord. Kendall's Advanced Theory of Statistics. Edward Arnold, 1991.

78

G. Syswerda. Schedule optimization using genetic algorithms. In L. Davis, editor, Handbook of Genetic Algorithms. Van Nostrand Reinhold, New, York, 1990.

79

D. Whitley, T. Starkweather, and D'Ann Fuquay. Scheduling problems and travelling salesman: The genetic edge recombination operator. In Schaffer [69].

80

P. Wichmann. Cryptanalysis of a modified rotor machine. Lecture notes in computer science, 434, 1990.