Computer Science – Cryptography and Security
Scientific paper
2012-01-23
Computer Science
Cryptography and Security
Scientific paper
In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used to recover the solution are known from fast correlation attacks on stream ciphers. As in fast correlation attacks, the performance of the algorithm depends on the number of equations given. It is shown that if this number exceeds a certain bound, and the bias of the noisy equations is polynomial in number of unknowns, the running time of the algorithm is reduced to almost cube root time compared to the brute force checking of all possible solutions. The mentioned bound is explicitly given and it is further shown that when this bound is exceeded, the complexity of the approach can even be further reduced.
No associations
LandOfFree
Solving the LPN problem in cube-root time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solving the LPN problem in cube-root time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the LPN problem in cube-root time will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-497990