Wyner-Ziv reconciliation for key exchange based on Ring-LWE

01/13/2020
by   Charbel Saliba, et al.
0

We consider a key encapsulation mechanism (KEM) based on ring-LWE where reconciliation is performed on an N-dimensional lattice using Wyner-Ziv coding. More precisely, we consider Barnes-Wall lattices and use Micciancio and Nicolosi's bounded distance decoder with polynomial complexity O(N log(N)^2). We show that in the asymptotic regime for large N, the achievable key rate is Θ(log N) bits per dimension, while the error probability P_e ≈O(e^-Nϵ). Unlike previous works, our scheme does not require a dither.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2022

An Improved Lattice-Based Ring Signature with Unclaimable Anonymity in the Standard Model

Ring signatures enable a user to sign messages on behalf of an arbitrary...
research
10/04/2021

Error Correction for FrodoKEM Using the Gosset Lattice

We consider FrodoKEM, a lattice-based cryptosystem based on LWE, and pro...
research
05/06/2022

Public key cryptography based on skew dihedral group rings

In this paper, we propose to use a skew dihedral group ring given by the...
research
05/17/2021

Cryptanalysis of Semidirect Product Key Exchange Using Matrices Over Non-Commutative Rings

It was recently demonstrated that the Matrix Action Key Exchange (MAKE) ...
research
03/07/2018

Good Distance Lattices from High Dimensional Expanders

We show a new framework for constructing good distance lattices from hig...
research
01/23/2018

On the Key Generation Rate of Physically Unclonable Functions

In this paper, an algebraic binning based coding scheme and its associat...
research
04/07/2023

Ring-Rotor: A Novel Retractable Ring-shaped Quadrotor with Aerial Grasping and Transportation Capability

This letter presents a novel and retractable ring-shaped quadrotor calle...

Please sign up or login with your details

Forgot password? Click here to reset