Cryptography and Coding
Springer Berlin (Verlag)
978-3-540-66887-9 (ISBN)
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.
Erscheint lt. Verlag | 8.12.1999 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | X, 352 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 438 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | aes • algorithms • Boolean functions • Boolesche Funktion • Code • Codierung • Coding • coding theory • Communication • Complexity • cryptography • Data Compression • data encryption • Decoding Algorithms • error-correcting code • Error-correcting codes • Finite-Field Computations • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Kryptographie / Kryptologie • Kryptologie • Random Numbers • telecommunications |
ISBN-10 | 3-540-66887-X / 354066887X |
ISBN-13 | 978-3-540-66887-9 / 9783540668879 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich