|
Code-based Cryptography Workshop 2012
Recent-results Session
Session I (Wednesday morning, 12:00‒13:00)
- Irene Márquez-Corbella (University of Valladolid):
A Characterization of MDS codes that have an Error-correcting
Pair.
slides
-
Sihem Mesnager (Université de Paris VIII):
On Bent and Hyper-bent functions via Dillon-like
exponents.
slides
-
Edoardo Persichetti (University of Auckland):
Efficient implementation of a CCA2-secure variant of McEliece
using generalized Srivastava codes.
slides
Session II (Wednesday afternoon, 14:30‒15:30 )
- Hang Dinh (Indiana University South Bend):
Code Equivalence is Hard for Shor-like Quantum Algorithms.
slides
-
Dimitris Simos (INRIA Rocquencourt):
The Support Splitting Algorithm and its application to
Code-based Cryptography.
slides
-
Matthieu Legeay (IRMAR ‒ University of Rennes):
Projected Subcodes of the Second Order Binary Reed-Muller
Code.
slides
-
Rafael Misozcki (INRIA Rocquencourt):
Improved LDPC and QC-LDPC McEliece variants.
slides
Session III (Thursday morning, 12:00‒13:00)
-
Grégory Landais (INRIA Rocquencourt):
CFS Software Implementation.
slides
-
Julien Schrek (University of Limoges):
An efficient one time code based signature scheme.
slides
-
Valérie Gauthier (Université de Caen):
A Distinguisher-based Attack of a Homomorphic Encryption
Scheme relying on Reed-Solomon codes.
slides
|
