Contents

pp v-vi

Contributors

pp vii-viii

Introduction

pp ix-xii

I - NUMBER THEORETIC ASPECTS OF CRYPTOLOGY

1 - Some mathematical aspects of recent advances in cryptology

pp 1-8

2 - Quadratic fields and cryptography

pp 9-25

3 - Parallel algorithms for integer factorisation

pp 26-37

4 - An open architecture number sieve

pp 38-75

5 - Algorithms for finite fields

pp 76-85

6 - Notes on continued fractions and recurrence sequences

pp 86-97

II - CRYPTOGRAPHIC DEVICES AND APPLICATIONS

7 - Security in telecommunication services over the next decade

pp 98-105

8 - Linear feedback shift registers and stream ciphers

pp 106-119

9 - Applying randomness tests to commercial level block ciphers

pp 120-128

10 - Pseudo-random sequence generators using structured noise

pp 129-136

11 - Privacy for MACNET

pp 137-148

12 - Authentication

pp 149-155

13 - Insecurity of the knapsack one-time pad

pp 156-164

14 - The tactical frequency management problem: heuristic search and simulated annealing

pp 165-174

15 - Reed-Solomon coding in the complex field

pp 175-176

PART III - DIOPHANTINE ANALYSIS

16 - Class number problems for real quadratic fields

pp 177-195

17 - Number theoretic problems involving two independent bases

pp 196-203

18 - A class of normal numbers II

pp 204-210

19 - Notes on uniform distribution

pp 211-212

20 - Thue equations and multiplicative independence

pp 213-220

21 - A number theoretic crank associated with open bosonic strings

pp 221-226

22 - Universal families of abelian varieties

pp 227-236