Parallel-CFS strengthening the CFS McEliece-based signature scheme

Abstract

This article presents a modification of the CFS code based signature scheme. By producing two (or more generally i) signatures in parallel, we show that it is possible to protect this scheme from "one out of many" decoding attacks. With this modification, and at the cost of slightly larger signatures, it is possible to use smaller parameters for the CFS signature, thus making this new Parallel-CFS construction more practical than standard CFS signatures. © 2011 Springer-Verlag Berlin Heidelberg.