Category:LNCS 1025

From BibNetWiki

Lecture Notes in Computer Science, Volume 1025

Articles in category "LNCS 1025"

There are 31 articles in this category.

A A Broadcast Key Distribution Scheme Based on Block Designs A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes A Note on the Hash Function of Tillich and Zemor A Storage Complexity Based Analogue of Maurer Key Esablishment Using Public Channels An Elliptic Curve Analogue of McCurley's Key Agreement Scheme Analysis of Sequence Segment Keying as a Method of CDMA Transmission Authentication Codes: an Area where Coding and Cryptology Meet C Church-Rosser Codes Coding and Cryptography for Speech and Vision Computation of Low-Weight Parity Checks for Correlation Attacks on Stream Ciphers

C cont. Constructions for Variable-Length Error-Correcting Codes Cryptanalysis of Harari's Identification Scheme Cryptography and coding: 5th IMA conference, Cirencester, UK, December 18-20, 1995, proceedings D Design Choices and Security Implications in Implementing Diffie-Hellman Key Agreement Distribution of Recurrent Sequences Modulo Prime Powers E Efficient Generation of Binary Words of Given Weight G Good Codes Based on Very Sparse Matrices H How Traveling Salespersons Prove Their Identity L Linear Span Analysis of a Set of Periodic Sequence Generators M Minimal Supports in Linear Codes Minimal Weight k-SR Representations

M cont. Multi-Dimensional Ring TCM Codes for Fading Channels O On-Line Secret Sharing P Prepaid Electronic Cheques Using Public-Key Certificates Q Quantum Cryptography: Protecting our Future Networks with Quantum Mechanics S Sequential Decoding for a Subcode of Reed Solomon Codes Soft Decision Decoding of Reed Solomon Codes Using the Dorsch Algorithm Some Constructions of Generalised Concatenated Codes Based on Unit Memory Codes Some Decoding Applications of Minimal Realization T The Main Conjecture for MDS Codes The Synthesis of Perfect Sequences