Analysis of error dependencies on NewHope

by   Minki Song, et al.

Among many submissions to the NIST post-quantum cryptography (PQC) project, NewHope is a promising key encapsulation mechanism (KEM) based on the Ring-Learning with errors (Ring-LWE) problem. Since NewHope is an indistinguishability (IND)-chosen ciphertext attack secure KEM by applying the Fujisaki-Okamoto transform to an IND-chosen plaintext attack secure public key encryption, accurate calculation of decryption failure rate (DFR) is required to guarantee resilience against attacks that exploit decryption failures. However, the current upper bound of DFR on NewHope is rather loose because the compression noise, the effect of encoding/decoding of NewHope, and the approximation effect of centered binomial distribution are not fully considered. Furthermore, since NewHope is a Ring-LWE based cryptosystem, there is a problem of error dependency among error coefficients, which makes accurate DFR calculation difficult. In this paper, we derive much tighter upper bound on DFR than the current upper bound using constraint relaxation and union bound. Especially, the above-mentioned factors are all considered in derivation of new upper bound and the centered binomial distribution is not approximated to subgaussian distribution. In addition, since the error dependency is considered, the new upper bound is much closer to the real DFR than the previous upper bound. Furthermore, the new upper bound is parameterized by using Chernoff-Cramer bound in order to facilitate calculation of new upper bound for the parameters of NewHope. Since the new upper bound is much lower than the DFR requirement of PQC, this DFR margin is used to improve the security and bandwidth efficiency of NewHope. As a result, the security level of NewHope is improved by 7.2



There are no comments yet.


page 1

page 2

page 3

page 4


An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

Using lie algebra, this brief text provides an upper bound on the univer...

An improved upper bound on the integrality ratio for the s-t-path TSP

We give an improved analysis of the best-of-many Christofides algorithm ...

Improving security and bandwidth efficiency of NewHope using error-correction schemes

Among many submissions to the NIST post-quantum cryptography (PQC) proje...

A Single-Letter Upper Bound to the Mismatch Capacity

We derive a single-letter upper bound to the mismatched-decoding capacit...

An Upper Bound for Wiretap Multi-way Channels

A general model for wiretap multi-way channels is introduced that includ...

An Upper Bound for Random Measurement Error in Causal Discovery

Causal discovery algorithms infer causal relations from data based on se...

Tighter bounds lead to improved classifiers

The standard approach to supervised classification involves the minimiza...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.