000 06102nam a22006375i 4500
001 978-3-540-35482-6
003 DE-He213
005 20240730192844.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540354826
_9978-3-540-35482-6
024 7 _a10.1007/11779360
_2doi
050 4 _aQA268
050 4 _aQ350-390
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aGPF
_2thema
082 0 4 _a003.54
_223
245 1 0 _aCoding and Cryptography
_h[electronic resource] :
_bInternational Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005, Revised Selected Papers /
_cedited by Øyvind Ytrehus.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXII, 444 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSecurity and Cryptology,
_x2946-1863 ;
_v3969
505 0 _aSecond Support Weights for Binary Self-dual Codes -- On Codes Correcting Symmetric Rank Errors -- Error and Erasure Correction of Interleaved Reed-Solomon Codes -- A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes -- On the Weights of Binary Irreducible Cyclic Codes -- 3-Designs from Z 4-Goethals-Like Codes and Variants of Cyclotomic Polynomials -- Space-Time Code Designs Based on the Generalized Binary Rank Criterion with Applications to Cooperative Diversity -- Geometric Conditions for the Extendability of Ternary Linear Codes -- On the Design of Codes for DNA Computing -- Open Problems Related to Algebraic Attacks on Stream Ciphers -- On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two -- Interpolation of Functions Related to the Integer Factoring Problem -- On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography -- Finding Good Differential Patterns for Attacks on SHA-1 -- Extending Gibson's Attacks on the GPT Cryptosystem -- Reduction of Conjugacy Problem in Braid Groups, Using Two Garside Structures -- A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy -- Multi-Dimensional Hash Chains and Application to Micropayment Schemes -- On the Affine Transformations of HFE-Cryptosystems and Systems with Branches -- Dimension of the Linearization Equations of the Matsumoto-Imai Cryptosystems -- RSA-Based Secret Handshakes -- On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes -- ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps -- A New Public-Key Cryptosystem Based on the Problem of Reconstructing p-Polynomials -- On the Wagner-Magyarik Cryptosystem -- Constructions ofComplementary Sequences for Power-Controlled OFDM Transmission -- A Novel Method for Constructing Almost Perfect Polyphase Sequences -- Linear Filtering of Nonlinear Shift-Register Sequences -- Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation -- Frequency/Time Hopping Sequences with Large Linear Complexities -- One and Two-Variable Interlace Polynomials: A Spectral Interpretation -- Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights -- Locally Invertible Multivariate Polynomial Matrices.
520 _aThisvolumecontainsrefereedpapersdevotedtocodingandcryptography.These papers arethe full versionsof a selectionof the best extended abstractsaccepted for presentation at the International Workshop on Coding and Cryptography (WCC 2005) held in Bergen, Norway, March 14-18, 2005. Each of the 118 - tended abstracts originallysubmitted to the workshop were reviewed by at least two members of the Program Committee. As a result of this screening process, 58 papers were selected for presentation, of which 52 were eventually presented at the workshop together with four invited talks. The authors of the presented papers were in turn invited to submit full v- sions of their papers to the full proceedings. Each of the full-version submissions were once again thoroughly examined and commented upon by at least two reviewers. This volume is the end result of this long process. I am grateful to the reviewers who contributed to guaranteeing the high standards of this volume, and who are named on the next pages. It was a pl- sure for me to work with my program co-chair Pascale Charpin, whose expe- enced advice I havefurther bene?ted greatly from during the preparationof this ´ volume. Discussions with Tor Helleseth and Angela Barbero were also useful in putting the volume together. Finally, I would like to thank all the authors and all the other participants of the WCC 2005 for making it in every sense a highly enjoyable event.
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer networks .
_931572
650 1 4 _aCoding and Information Theory.
_9151522
650 2 4 _aCryptology.
_931769
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Communication Networks.
_9151523
700 1 _aYtrehus, Øyvind.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151524
710 2 _aSpringerLink (Online service)
_9151525
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540354819
776 0 8 _iPrinted edition:
_z9783540825869
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v3969
_9151526
856 4 0 _uhttps://doi.org/10.1007/11779360
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94468
_d94468