Banking union in historical perspective: the initiative of the European Commission in the 1960s-1970s

This article shows that planning for the organization of EU banking regulation and supervision did not just appear on the agenda in recent years with discussions over the creation of the eurozone banking union. It unveils a hitherto neglected initiative of the European Commission in the 1960s and early 1970s. Drawing on extensive archival work, this article explains that this initiative, however, rested on a number of different assumptions, and emerged in a much different context. It first explains that the Commission's initial project was not crisis-driven; that it articulated the link between monetary integration and banking regulation; and finally that it did not set out to move the supervisory framework to the supranational level, unlike present-day developments

Towards a Secure Goppa Decoder in Hardware Implementation

The irreducible binary Goppa codes are widely used in code-based cryptography, like in the McEliece cryptosystem. The aim of this work is to design an effi cient and secure hardware implementation of a Goppa decoder. We will show how to adapt a common step of all decoding algorithms to obtain a "leakage resistant" variant

Towards a Secure Implementation of a Goppa Decoder

The irreducible binary Goppa codes are widely used in code-based cryptography, like in the McEliece cryptosystem. The aim of this work is to design an e cient and secure hardware implementation of a Goppa decoder. Patterson proposed in 1975 an algorithm able to e ciently decode those codes. We will show how to adapt this algorithm to obtain a "leakage resistant" variant

Modular multiplication in the AMNS representation : Hardware Implementation

International audienceThis paper describes a hardware implementation of the modular multiplication using the Adapted Modular Number System (AMNS) representation of large integers. We propose a novel adaptation of the FIOS block Montgomery multiplication fitted to the AMNS representation. We explore multiple operations schedulings for the design of systolic architectures well suited to this FIOS algorithm. Our scalable implementation targets Ultrascale FPGA devices and takes full advantage of modern DSP48E2 Slices. We provide open-source, ready to use designs which are scalable to any width of the operands and a large range of AMNS parameters. Our designs can perform 256, 512, 1024, 2048 and 4096 bits modular multiplications in 0.178, 0.362, 0.764, 1.57 and 2.96 µs using 18, 35, 65, 125 and 245 DSP block respectively. They can allow for an improvement in computing speed and DSP AT (Digital Signal Processing block Area-Time product) of up to 17% and 13% respectively compared to state of the art implementations.</div

A zero-knowledge identification scheme based on the q-ary Syndrome Decoding problem

At CRYPTO’93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern’s information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern’s scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography

Extended security arguments for signature schemes

International audienceIt is known how to transform certain canonical three-pass identification schemes into signature schemes via the Fiat–Shamir transform. Pointcheval and Stern showed that those schemes are existentially unforgeable in the random-oracle model leveraging the, at that time, novel forking lemma. Recently, a number of 5-pass identification protocols have been proposed. Extending the above technique to capture 5-pass identification schemes would allow to obtain novel unforgeable signature schemes. In this paper, we provide an extension of the forking lemma (and the Fiat–Shamir transform) in order to assess the security of what we call n-generic signature schemes. These include signature schemes that are derived from certain (2n+1)-pass identification schemes. In doing so, we put forward a generic methodology for proving the security of a number of signature schemes derived from (2n+1)-pass identification schemes for n≥2. As an application of this methodology, we obtain two new code-based existentially-unforgeable signature schemes, along with a security reduction. In particular, we solve an open problem in multivariate cryptography posed by Sakumoto, Shirai and Hiwatari at CRYPTO 2011