Cryptography and Coding
Editat de Michael Walkeren Limba Engleză Paperback – 8 dec 1999
Preț: 322.82 lei
Preț vechi: 403.53 lei
-20%
Puncte Express: 484
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: 9783540668879
ISBN-10: 354066887X
Pagini: 332
Ilustrații: X, 352 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354066887X
Pagini: 332
Ilustrații: X, 352 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Applications of Exponential Sums in Communications Theory.- Some Applications of Bounds for Designs to the Cryptography.- Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions.- Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics?.- A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System.- New Self-Dual Codes over GF(5).- Designs, Intersecting Families, and Weight of Boolean Functions.- Coding Applications in Satellite Communication Systems [Invited Paper].- A Unified Code.- Enhanced Image Coding for Noisy Channels.- Perfectly Secure Authorization and Passive Identification for an Error Tolerant Biometric System.- An Encoding Scheme for Dual Level Access to Broadcasting Networks.- Photograph Signatures for the Protection of Identification Documents.- An Overview of the Isoperimetric Method in Coding Theory (Extended Abstract) [Invited Paper].- Rectangular Basis of a Linear Code.- Graph Decoding of Array Error-Correcting Codes.- Catastrophicity Test for Time-Varying Convolutional Encoders.- Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes.- On Efficient Decoding of Alternant Codes over a Commutative Ring?.- Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes.- Advanced Encryption Standard (AES) - An Update [Invited Paper].- The Piling-Up Lemma and Dependent Random Variables.- A Cryptographic Application of Weil Descent.- Edit Probability Correlation Attack on the Bilateral Stop/Go Generator.- Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract).- On the Combined Fermat/Lucas Probable Prime Test?.- On the Cryptanalysis of Nonlinear Sequences [InvitedPaper].- Securing Aeronautical Telecommunications [Invited Paper].- Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography (Extended Abstract).- Delegated Decryption.- Fast and Space-Efficient Adaptive Arithmetic Coding?.- Robust Protocol for Generating Shared RSA Parameters.- Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes.- Weaknesses in Shared RSA Key Generation Protocols.- Digital Signature with Message Recovery and Authenticated Encryption (Signcryption) - A Comparison.