Cryptography and coding. 5th IMA conference, Cirencester, UK, December 18-20, 1995. Proceedings (Q1910499)

The articles of this volume will be reviewed individually. The 3rd conference has been reviewed (see Zbl 0790.00017). Indexed articles: \textit{Korjik, Valeri; Ivkov, Michael; Merinovich, Yuri; Barg, Alexander; van Tilborg, Henk C. A.}, A broadcast key distribution scheme based on block designs, 2-12 [Zbl 1383.94027] \textit{Ashikhmin, Alexei; Barg, Alexander}, Minimal supports in linear codes, 13 [Zbl 1383.94054] \textit{Shin, Sooyoung Kim; Sweeney, Peter}, Sequential decoding for a subcode of Reed Solomon codes, 14-21 [Zbl 1383.94060] \textit{Caballero-Gil, P.; Fúster-Sabater, A.}, Linear span analysis of a set of periodic sequence generators, 22-33 [Zbl 1383.94008] \textit{Han, Yongfei; Gollmann, Dieter; Mitchell, Chris}, Minimal weight \(k\)-SR representations, 34-43 [Zbl 1383.94021] \textit{Hirschfeld, J. W. P.}, The main conjecture for MDS codes, 44-52 [Zbl 1383.94056] \textit{Norton, Graham}, Some decoding applications of minimal realization, 53-62 [Zbl 1383.94058] \textit{Fan, P. Z.; Darnell, M.}, The synthesis of perfect sequences, 63-73 [Zbl 1383.94009] \textit{Penzhorn, W. T.; Kühn, G. J.}, Computation of low-weight parity checks for correlation attacks on stream ciphers, 74-83 [Zbl 1383.94038] \textit{Mitchell, C. J.}, A storage complexity based analogue of Maurer key establishment using public channels, 84-93 [Zbl 1383.94033] \textit{Ho, H. P.; Sweeney, P.}, Soft decision decoding of Reed Solomon codes using the Dorsch algorithm, 94-99 [Zbl 1383.94057] \textit{MacKay, David J. C.; Neal, Radford M.}, Good codes based on very sparse matrices, 100-111 [Zbl 1398.94240] \textit{Phoenix, Simon J. D.; Townsend, Paul D.}, Quantum cryptography: protecting our future networks with quantum mechanics, 112-131 [Zbl 1398.81073] \textit{Radu, Cristian; Govaerts, René; Vandewalle, Joos}, Prepaid electronic cheques using public-key certificates, 132-141 [Zbl 1398.94153] \textit{Lucks, Stefan}, How traveling salespersons prove their identity, 142-149 [Zbl 1398.94138] \textit{Smith, Andrew; Boyd, Colin}, An elliptic curve analogue of McCurley's key agreement scheme, 150-157 [Zbl 1398.94163] \textit{Ahmadian-Attari, M.; Farrell, P. G.}, Multi-dimensional ring TCM codes for fading channels, 158-168 [Zbl 1398.94227] \textit{van Tilborg, Henk C. A.}, Authentication codes: an area where coding and cryptology meet, 169-183 [Zbl 1383.94053] \textit{Sendrier, Nicolas}, Efficient generation of binary words of given weight, 184-187 [Zbl 1398.94087] \textit{Pinch, Richard G. E.}, Distribution of recurrent sequences modulo prime powers, 188-189 [Zbl 1398.11036] \textit{Cachin, Christian}, On-line secret sharing, 190-198 [Zbl 1398.94193] \textit{Oleshchuk, Vladimir A.}, Church-Rosser codes, 199-204 [Zbl 1398.94148] \textit{Canteaut, Anne}, A new algorithm for finding minimum-weight words in large linear codes, 205-212 [Zbl 1398.94102] \textit{Stansfield, E. V.; Walker, M.}, Coding and cryptography for speech and vision, 213-236 [Zbl 1398.94166] \textit{Zyablov, Victor; Shavgulidze, Sergo; Justesen, Jorn}, Some constructions of generalised concatenated codes based on unit memory codes, 237-256 [Zbl 1398.94242] \textit{Geiselmann, Willi}, A note on the hash function of Tillich and Zémor, 257-263 [Zbl 1398.94119] \textit{Véron, Pascal}, Cryptanalysis of Harari's identification scheme, 264-269 [Zbl 1398.94173] \textit{Quirke, T. M.; Darnell, M.}, Analysis of sequence segment keying as a method of CDMA transmission, 270-281 [Zbl 1398.94018] \textit{Buttigieg, Victor; Farrell, Patrick G.}, Constructions for variable-length error-correcting codes, 282-291 [Zbl 1398.94238]