Publication

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Yanina Yurina Shkel
2020
Conference Papers

Abstract

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic cryptographic approaches. We investigate the performance of polar coding schemes for generating the secret key over short blocklengths. Our simulation results show that the proposed scheme achieves close to theoretical upper bounds at short blocklengths.

Official source

https://infoscience.epfl.ch/entities/publication/fc70e1df-b906-4ccc-ba83-2dda9421e312

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Chat with Graph Search

Secure and Efficient Cryptographic Algorithms in a Quantum World

On the Theory and Practice of Modern Secure Messaging

An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation