Parallel-CFS - Strengthening the CFS McEliece-Based Signature Scheme
نویسنده
چکیده
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.
منابع مشابه
A New Signature Scheme Based on Punctured Reed-Muller Code With Random Insertion
In this paper, we propose a new signature scheme based on a punctured Reed–Muller (RM) code with random insertion, which improves the Goppa code-based signature scheme developed by Courtois, Finiasz, and Sendrier (CFS). The CFS signature scheme has certain drawbacks in terms of scaling of the parameters and a lack of existential unforgeability under adaptive chosen message attacks (EUF-CMA) sec...
متن کاملThe Evaluation of Data Distributions for Multi-Dimensional Sparse Arrays Based on the EKMR Scheme
In our previous work, we have studied the performance of three data distribution schemes, Send Followed Compress (SFC), Compress Followed Send (CFS), and Encoding-Decoding (ED), for sparse arrays based on the traditional matrix representation (TMR) scheme. Since multi-dimensional arrays can also be represented by the extended Karnaugh map representation (EKMR) scheme, in this paper, we first ap...
متن کاملCFS Software Implementation
CFS is the first practical code-based signature scheme. In the present paper, we present the initial scheme and its evolutions, the attacks it had to face and the countermeasures applied. We will show that all things considered the system remains practical and we present a software implementation of the signing primitive. For eighty bits of security our implementation produces a signature in 1....
متن کاملThe CFS and ED Data Distribution Schemes for Sparse Arrays on Distributed Memory Multicomputers
A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression. In the data partition phase, a global sparse array is partitioned into some local sparse arrays. In the data distribution phase, these local sparse arrays are distributed to processors. In the data compression phase,...
متن کاملSide channels attacks in code-based cryptography
The McEliece and the Niederreiter public key cryptosystems (PKC) are supposed secure in a post quantum world [4] because there is no e cient quantum algorithm for the underlying problems upon which these cryptosystems are built. The CFS, Stern and KKS signature schemes are post-quantum secure because they are based on hard problems of coding theory. The purpose of this article is to describe wh...
متن کامل