Coding and Cryptography
Editat de Øyvind Ytrehusen Limba Engleză Paperback – 6 iul 2006
Preț: 333.30 lei
Preț vechi: 416.63 lei
-20%
Puncte Express: 500
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540354819
ISBN-10: 3540354816
Pagini: 460
Ilustrații: XII, 444 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.78 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540354816
Pagini: 460
Ilustrații: XII, 444 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.78 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Second 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.