[Resource Topic] 2018/278: Mixed-radix Naccache-Stern encryption

Welcome to the resource topic for 2018/278

Mixed-radix Naccache-Stern encryption

Authors: Rémi Géraud, David Naccache


In this work we explore a combinatorial optimization problem stemming from the Naccache-Stern cryptosystem. We show that solving this problem results in bandwidth improvements, and suggest a polynomial-time approximation algorithm to find an optimal solution. Our work suggests that using optimal radix encoding results in an asymptotic 50% increase in bandwidth.

ePrint: https://eprint.iacr.org/2018/278

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .