Related papers: Secret Key Cryptosystem based on Polar Codes over …
This paper analyzes the security of a recently-proposed signal encryption scheme based on a filter bank. A very critical weakness of this new signal encryption procedure is exploited in order to successfully recover the associated secret…
Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…
In this article, an encryption scheme based on (-1, 1) conference matrix has been developed. The decryption key comprising of fixed number of positive integers with prime power yields the high level security of message. Some popular attacks…
Polar codes were originally specified for codelengths that are powers of two. In many applications, it is desired to have a code that is not restricted to such lengths. Two common strategies of modifying the length of a code are shortening…
We consider the secure communication problem for broadcasting of two encrypted sources. The sender wishes to broadcast two secret messages via two common key cryptosystems. We assume that the adversary can use the side-channel, where the…
New algorithms for efficient decoding of polar codes (which may be CRC-augmented), transmitted over either a binary erasure channel (BEC) or an additive white Gaussian noise channel (AWGNC), are presented. We start by presenting a new…
Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers. Re-searchers have focused on developing algorithms that can withstand attacks from both classical and quantum computers,…
Private Information Retrieval (PIR) schemes allow clients to retrieve files from a database without disclosing the requested file's identity to the server. In the pursuit of post-quantum security, most recent PIR schemes rely on hard…
We introduce \textbf{RankGuard-Polar}, a framework for safely publishing a subset of polar codeword coordinates over shared public resources. We assume a strong eavesdropper who has access to the channel input, i.e., the transmitted…
By realizing a quantum cryptography system based on polarization entangled photon pairs we establish highly secure keys, because a single photon source is approximated and the inherent randomness of quantum measurements is exploited. We…
In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique,…
Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper…
We propose a simple yet complete lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves strong secret key rates up to 1/2 nat from the optimal in the case of…
Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means…
This paper proposed the application of post-encryption-compression (PEC) to strengthen the secrecy in the case of distributed encryption where the encryption keys are correlated to each other. We derive the universal code construction for…
We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one,…
In this paper we propose a feedback scheme for transmitting secret messages between two legitimate parties, over an eavesdropped communication link. Relative to Wyner's traditional encoding scheme \cite{wyner1}, our feedback-based encoding…
Polar codes can theoretically achieve very competitive Frame Error Rates. In practice, their performance may depend on the chosen decoding procedure, as well as other parameters of the communication system they are deployed upon. As a…
The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…
The probabilistic shaping scheme from Honda and Yamamoto (2013) for polar codes is used to enable power-efficient signaling for on-off keying (OOK). As OOK has a non-symmetric optimal input distribution, shaping approaches that are based on…