The problem with the SURF scheme

Abstract

There is a serious problem with one of the assumptions made in the security proof of the SURF scheme. This problem turns out to be easy in the regime of parameters needed for the SURF scheme to work. We give afterwards the old version of the paper for the reader's convenience.

arXiv commentWarning : we found a serious problem in the security proof of the SURF scheme. We explain this problem here and give the old version of the paper afterwards

References in corpus (4)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Quantum Information Set Decoding Algorithms
• Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
• A tight security reduction in the quantum random oracle model for code-based signature schemes