A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
From MaRDI portal
Publication:2977130
DOI10.1109/TIT.2015.2475738zbMath1359.94602arXiv1409.0472MaRDI QIDQ2977130
Thomas Johansson, Qian Guo, Carl Löndahl
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.0472
Related Items (5)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ A new birthday-type algorithm for attacking the fresh re-keying countermeasure ⋮ Solving LPN using covering codes ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
