000 04337nam a22005535i 4500
001 978-3-540-49280-1
003 DE-He213
005 20160624102041.0
007 cr nn 008mamaa
008 121227s1995 gw | s |||| 0|eng d
020 _a9783540492801
_9978-3-540-49280-1
024 7 _a10.1007/3-540-60693-9
_2doi
050 4 _aQA76.9.A25
072 7 _aURY
_2bicssc
072 7 _aCOM053000
_2bisacsh
082 0 4 _a005.82
_223
245 1 0 _aCryptography and Coding
_h[electronic resource] :
_b5th IMA Conference Cirencester, UK, December 18–20, 1995 Proceedings /
_cedited by Colin Boyd.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
300 _aXI, 297 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1025
505 0 _aDesign choices and security implications in implementing Diffie-Hellman key agreement -- A broadcast key distribution scheme based on block designs -- Minimal supports in linear codes -- Sequential decoding for a subcode of Reed Solomon Codes -- Linear Span analysis of a set of periodic sequence generators -- Minimal weight k-SR representations -- The main conjecture for MDS codes -- Some decoding applications of minimal realization -- The synthesis of perfect sequences -- Computation of low-weight parity checks for correlation attacks on stream ciphers -- A storage complexity based analogue of Maurer key establishment using public channels -- Soft decision decoding of Reed Solomon codes using the Dorsch algorithm -- Good codes based on very sparse matrices -- Quantum cryptography: Protecting our future networks with quantum mechanics -- Prepaid electronic cheques using public-key certificates -- How traveling salespersons prove their identity -- An elliptic curve analogue of McCurley's key agreement scheme -- Multi-dimensional ring TCM codes for fading channels -- Authentication codes: An area where coding and cryptology meet -- Efficient generation of binary words of given weight -- Distribution of recurrent sequences modulo prime powers -- On-line secret sharing -- Church-Rosser codes -- A new algorithm for finding minimum-weight words in large linear codes -- Coding and cryptography for speech and vision -- Some constructions of generalised concatenated codes based on unit memory codes -- A note on the hash function of Tillich and Zémor -- Cryptanalysis of Harari's identification scheme -- Analysis of sequence segment keying as a method of CDMA transmission -- Constructions for variable-length error-correcting codes.
520 _aThis book constitutes the refereed proceedings of the 5th IMA Conference on Cryptography and Coding, held in Cirencester, UK in December 1995. The volume presents 22 full revised papers selected from 48 submissions together with five invited full papers and three abstracts on the mathematical theory and practice of cryptography and coding; continuing advances in these strongly related areas are crucial for the security and reliability of data communication, processing, and storage. Among the topics addressed are linear codes, error-correcting codes, decoding, key distribution, authentication, hash functions, block ciphers, cryptanalysis, and electronic cash.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData encryption (Computer science).
650 0 _aCoding theory.
650 0 _aCombinatorics.
650 0 _aManagement information systems.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aCoding and Information Theory.
650 2 4 _aCombinatorics.
650 2 4 _aComputer Communication Networks.
650 2 4 _aBusiness Information Systems.
700 1 _aBoyd, Colin.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540606932
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1025
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-60693-9
942 _2EBK6736
_cEBK
999 _c36030
_d36030