BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Efficient Code-Based Encryption Without Trapdoors
DTSTART:20160601T120000Z
DTEND:20160601T133000Z
DTSTAMP:20240424T060200Z
UID:indico-event-1344@indico.math.cnrs.fr
DESCRIPTION:Speakers: Jean-Christophe Deneuville\n\nIn this talk we propos
e an efficient code-based cryptosys-\ntem with no hidden trapdoor in the p
ublic matrix. The system is in the\nspirit of a system proposed by Alekhno
vich in 2003 based on random\nmatrices\, but still our approach is slightl
y different and optimized in or-\nder to obtain security reduction to deco
ding random quasi-cyclic codes.\nBeside a security proof we also provide a
detailed analysis of the decryp-\ntion failure probability of our scheme.
Our scheme benefits from a very\nfast decryption algorithm and has small
sizes of public key with only a\nfew thousand bits. The encryption is rath
er low but our system can be\nvery efficient for key exchange and authenti
cation. We also generalize\nour approach to rank metric for which we obtai
n even better parameters\nthan for Hamming metric.\n\n(travail commun avec
Carlos Aguilar Melchor\, Olivier Blazy\, Philippe Gaborit\, et Gilles ZĂ©
mor)\n\nhttps://indico.math.cnrs.fr/event/1344/
LOCATION:XR203 (FacultĂ© des sciences et Techniques)
URL:https://indico.math.cnrs.fr/event/1344/
END:VEVENT
END:VCALENDAR