Basics of Secrecy Coding
From MaRDI portal
Publication:3462200
DOI10.1007/978-3-0348-0667-1_71zbMath1342.47089OpenAlexW4250644247MaRDI QIDQ3462200
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
Cryptography (94A60) Applications of operator theory in systems, signals, circuits, and control theory (47N70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operator theory (47-01)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An information-theoretic model for steganography
- Efficient and robust key management for large mobile ad hoc networks
- Attacking and Defending the McEliece Cryptosystem
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- 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
- Applications of LDPC Codes to the Wiretap Channel
- Information Theoretic Security
- Reducing Key Length of the McEliece Cryptosystem
- Communication Theory of Secrecy Systems*
- A public key cryptosystem and a signature scheme based on discrete logarithms
- On secret sharing communication systems with two or three channels
- Privacy Amplification by Public Discussion
- Coding theorem for secret sharing communication systems with two noisy channels
- New directions in cryptography
- Channel identification for high speed digital communications
- The Wire-Tap Channel
- A method for obtaining digital signatures and public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- Broadcast channels with confidential messages
- Secret key agreement by public discussion from common information
- Approximation theory of output statistics
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- Common randomness in information theory and cryptography. I. Secret sharing
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
- On a special class of broadcast channels with confidential messages
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- 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
- On the structure of linear recurrent error-control codes
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Factor graphs and the sum-product algorithm
- Codes on graphs: normal realizations
- Design of capacity-approaching irregular low-density parity-check codes
- Public-key cryptography using paraunitary matrices
- Nested linear/lattice codes for structured multiterminal binning
- On the complexity of some cryptographic problems based on the general decoding problem
- Information-theoretic analysis of information hiding
- Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result
- The duality between information embedding and source coding with side information and some applications
- Duality between source coding and channel coding and its extension to the side information case
- Unconditionally secure key agreement and the intrinsic conditional information
- Writing on dirty paper (Corresp.)
- Generalized privacy amplification
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms
- Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
- Secrecy in Cooperative Relay Broadcast Channels
- Writing on wet paper
- Watermarking security: theory and practice
- Elements of Information Theory
- The Basic Theorems of Information Theory
- Wire-Tap Channel II
