Cryptography and coding : 7th IMA international conference Cirencester, UK, December 20 22, 1999 : proceedings

Salvato in:
Dettagli Bibliografici
Ente Autore: IMA Conference on Cryptography and coding :Cirencester, Royaume-Uni
Altri autori: Walker, Michael, 1947- (Direttore editoriale)
Natura: Livre numérique
Lingua:Anglais
Pubblicazione: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serie:Lecture notes in computer science 1746
Soggetti:
Accesso online:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Cryptography and coding, 7th IMA conference, Cirencester, UK, December 20-22, 1999, proceedings, Michael Walker (ed.), 1999, Berlin, Springer, 1 vol. (IX-312 p.), Lecture notes in computer science, 3-540-66887-X
• Cryptography and Coding, Texte imprimé, 9783662188248
Sommario:
  • 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.