Description
In 1978, McEliece introduced a public key encryption scheme based on linear codes and suggested to use classical Goppa codes, ie: subfield subcodes of algebraic geometric (AG) codes built on a curve of genus 0. This proposition remains secure and in order to have a generalization of classical Goppa codes, in 1996, H. Janwa and O. Moreno suggested to use subfield subcode of AG codes, which we call alternant AG codes. This proposition give a bigger choice of code because we can vary the curve, the genus, and the rational points of the divisor which generate the code. The principal limitation is the very large public keys of these codes compared to other public-key cryptosystems. To overcome this limitation, we decrease the key size by choosing codes which admit very compact public matrix. A way to obtained short key is to use codes having a non-trivial automorphisme group, for instance here we deal with quasi-cyclic alternant AG codes.
Prochains exposés
-
Oblivious Transfer from Zero-Knowledge Proofs (or how to achieve round-optimal quantum Oblivious Transfer without structure)
Orateur : Léo Colisson - Université Grenoble Alpes
We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable oblivious transfer (OT) protocol (the protocol itself involving quantum interactions), mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions…) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely[…]-
Cryptography
-