Basics of secrecy coding

DOI10.1007/978-3-0348-0667-1_71MaRDI QIDQ3462200zbMATH OpenOpenAlexFDO

Authors Phillip A. Regalia

Publication date 4 January 2016

Published in Operator Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-0348-0667-1_71

zbMATH Keywords

codingcryptographysecrecy codessteganographystrong and weak secrecy

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operator theory (47-01) Applications of operator theory in systems, signals, circuits, and control theory (47N70) Cryptography (94A60)

Recommendations

• Foundations of coding. Compression, encryption, error correction
• Basics of coding theory
• Coding and cryptography. Synergy for a robust communication
• Nested linear/lattice codes revisited
• Secret sharing with linear codes

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• An information-theoretic model for steganography
• Applications of LDPC Codes to the Wiretap Channel
• Approximation theory of output statistics
• Attacking and Defending the McEliece Cryptosystem
• Broadcast channels with confidential messages
• Channel identification for high speed digital communications
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Codes on graphs: normal realizations
• Coding theorem for secret sharing communication systems with two noisy channels
• Common randomness in information theory and cryptography. I. Secret sharing
• Communication Theory of Secrecy Systems*
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Design of capacity-approaching irregular low-density parity-check codes
• Duality between source coding and channel coding and its extension to the side information case
• Efficient and robust key management for large mobile ad hoc networks
• Elements of Information Theory
• Factor graphs and the sum-product algorithm
• Generalized privacy amplification
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 2221909 (Why is no real title available?)
• Information theoretic security
• Information-theoretic analysis of information hiding
• Information-theoretic key agreement: from weak to strong secret for free
• Introduction to cryptography with coding theory.
• Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
• Nested linear/lattice codes for structured multiterminal binning
• New directions in cryptography
• On a special class of broadcast channels with confidential messages
• On secret sharing communication systems with two or three channels
• On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
• On the complexity of some cryptographic problems based on the general decoding problem
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
• On the inherent intractability of certain coding problems (Corresp.)
• On the structure of linear recurrent error-control codes
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Privacy Amplification by Public Discussion
• Public-key cryptography using paraunitary matrices
• Reducing Key Length of the McEliece Cryptosystem
• Secrecy in Cooperative Relay Broadcast Channels
• Secret key agreement by public discussion from common information
• Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result
• The Basic Theorems of Information Theory
• The duality between information embedding and source coding with side information and some applications
• The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
• The Wire-Tap Channel
• Unconditionally secure key agreement and the intrinsic conditional information
• Watermarking security: theory and practice
• Wire-Tap Channel II
• Writing on dirty paper (Corresp.)
• Writing on wet paper

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Basics of secrecy coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462200)