Abstract. In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively convert our scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform. In contrast with all other CCA2-secure code-based cryptosystems that work in the random oracle model, our conversion does not require a constant weight encoding function. We present results for both 128-bit and 80-bit security level, and for the latter we also feature an implementation for an embedded device.
The last three years have witnessed tremendous progress in the understanding of code-based cryptography. One of its most promising applications is the design of cryptographic schemes with exceptionally strong security guarantees and other desirable properties. In contrast to number-theoretic problems typically used in cryptography, the underlying problems have so far resisted subexponential time attacks as well as quantum algorithms. This paper will survey the more recent developments.
Abstract. In this paper we present efficient implementations of several code-based identification schemes, namely the Stern scheme, the Véron scheme and the Cayrel-Véron-El Yousfi scheme. We also explain how to derive and implement signature schemes from the previous identification schemes using the Fiat-Shamir transformation. For a security of 80 bits and a document to be signed of size 1 kByte, we reach a signature in about 4 ms on a standard CPU.
proposed the stream cipher SYND as an improvement of the pseudo random number generator due to Fischer and Stern. This work shows how to improve considerably the efficiency the SYND cipher without using the so-called regular encoding and without compromising the security of the modified SYND stream cipher. Our proposal, called XSYND, uses a generic state transformation which is reducible to the Regular Syndrome Decoding problem (RSD), but has better computational characteristics than the regular encoding. A first implementation shows that XSYND runs much faster than SYND for a comparative security level (being more than three times faster for a security level of 128 bits, and more than 6 times faster for 400-bit security), though it is still only half as fast as AES in counter mode. Parallel computation may yet improve the speed of our proposal, and we leave it as future research to improve the efficiency of our implementation.
Summary --ZusammenfassungThe Unit-clause Proof Procedure with Equality. Besides a rigorous treatment of what we cM1 assignment and which describes more clearly the notion of substitutions done by a computer, a proof procedure is given which extends the scope of the unit-clause procedure to the first order predicate calculus with equality. The main part of the procedure is an algorithm which generates assignments instead of clauses in order to make inferences due to equalities. This procedure is equivalent to the unit-clause procedure extended by paramodulation. A machine proof of a theorem is given in the appendix.Das 1-Clausen-Beweisvcrfahren mit Gleiehheit. Es wird fiber ein Beweisverfahren bericbtet, das den Anwendungsbereich des 1-Clausen-Verfahrens auf den Pr//dikatenkalkfil 1. Stufe mit Gleichheit ausdehnt. Der Kern dieses Verfahrens ist ein Algorithrnus, der Belegungen anstelle von neuen Clausen erzeugt, um so Folgerungen aus Gleichheitsbeziehungen zu beriieksiehtigen. Das Verfahren ist /iqulvalent zu dem 1-Clausen-Verfahren, erweitert urn Paramodulation. Zns/~tzlieh wird der Begriff der Belegung untersucht, der eine genaue Besehreibung ftir die ]~rsetzung einer Variablen dutch einen Term liefert. Im Anhang ist der maschinelle Beweis eines Satzes aus der Gruppentheorie wiedergegeben.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.