Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Basics of Secrecy Coding - MaRDI portal

Basics of Secrecy Coding (Q3462200)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Basics of Secrecy Coding	scientific article

Statements

scholarly article

0 references

Basics of Secrecy Coding (English)

0 references

Phillip A. Regalia

0 references

Operator Theory

0 references

publication date

4 January 2016

0 references

zbMATH Keywords

cryptography

0 references

coding

0 references

secrecy codes

0 references

strong and weak secrecy

0 references

steganography

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-0348-0667-1_71

0 references

Common randomness in information theory and cryptography. I. Secret sharing

0 references

Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

0 references

The duality between information embedding and source coding with side information and some applications

0 references

On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels

0 references

Generalized privacy amplification

0 references

Privacy Amplification by Public Discussion

0 references

Reducing Key Length of the McEliece Cryptosystem

0 references

On the inherent intractability of certain coding problems (Corresp.)

0 references

Attacking and Defending the McEliece Cryptosystem

0 references

An information-theoretic model for steganography

0 references

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

0 references

Watermarking security: theory and practice

0 references

Writing on dirty paper (Corresp.)

0 references

Elements of Information Theory

0 references

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

0 references

Broadcast channels with confidential messages

0 references

New directions in cryptography

0 references

Secrecy in Cooperative Relay Broadcast Channels

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Public-key cryptography using paraunitary matrices

0 references

On the structure of linear recurrent error-control codes

0 references

Codes on graphs: normal realizations

0 references

The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders

0 references

Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem

0 references

Writing on wet paper

0 references

0 references

Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard

0 references

Approximation theory of output statistics

0 references

On the complexity of some cryptographic problems based on the general decoding problem

0 references

Factor graphs and the sum-product algorithm

0 references

On the equivalence of McEliece's and Niederreiter's public-key cryptosystems

0 references

Information Theoretic Security

0 references

Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

0 references

Secret key agreement by public discussion from common information

0 references

Unconditionally secure key agreement and the intrinsic conditional information

0 references

0 references

Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result

0 references

The Basic Theorems of Information Theory

0 references

Information-theoretic analysis of information hiding

0 references

Wire-Tap Channel II

0 references

0 references

Duality between source coding and channel coding and its extension to the side information case

0 references

Channel identification for high speed digital communications

0 references

Design of capacity-approaching irregular low-density parity-check codes

0 references

A method for obtaining digital signatures and public-key cryptosystems

0 references

Communication Theory of Secrecy Systems*

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

0 references

0 references

Applications of LDPC Codes to the Wiretap Channel

0 references

0 references

On a special class of broadcast channels with confidential messages

0 references

Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms

0 references

The Wire-Tap Channel

0 references

On secret sharing communication systems with two or three channels

0 references

Coding theorem for secret sharing communication systems with two noisy channels

0 references

Nested linear/lattice codes for structured multiterminal binning

0 references

Efficient and robust key management for large mobile ad hoc networks

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-0348-0667-1_71

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3462200

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3462200&oldid=36221622"