An improved fast correlation attack based on list decoding

An improvement of a recently reported powerful fast correlation attack is proposed and discussed. The proposed improvement is related to a construction of the decoding candidates list. The given theoretical analysis implies improvement of the algorithm performances assuming the same sample for processing and the same algorithm complexity.