People


Françoise Levy-dit-Vehel

Institution office homepage group
 Inria 31 🏠 Guests

Nones

New proofs of retrievability using locally decodable codes,
Julien Lavauzelle, Françoise Levy-dit-Vehel,
ISIT 2016
Information sets of Multiplicity codes,
Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô,
ISIT 2015
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers,
Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa,
CANS 2014
Security analysis of word problem-based cryptosystems,
Françoise Levy-dit-Vehel, Ludovic Perret,
Des. Codes Cryptography 2010
Cryptanalysis of MinRank,
Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret,
CRYPTO 2008
On the Wagner-Magyarik Cryptosystem,
Françoise Levy-dit-Vehel, Ludovic Perret,
WCC 2005
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups,
Françoise Levy-dit-Vehel, Ludovic Perret,
INDOCRYPT 2004
Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems,
Françoise Levy-dit-Vehel, Ludovic Perret,
INDOCRYPT 2003
Parameters of Goppa codes revisited,
Françoise Levy-dit-Vehel, Simon Litsyn,
IEEE Trans. Information Theory 1997
Bounds on the minimum distance of the duals of BCH codes,
Daniel Augot, Françoise Levy-dit-Vehel,
IEEE Trans. Information Theory 1996
More on the covering radius of BCH codes,
Françoise Levy-dit-Vehel, Simon Litsyn,
IEEE Trans. Information Theory 1996
Bounds on the minimum distance of the duals of extended BCH codes over \mathbbFp,
Françoise Levy-dit-Vehel,
Appl. Algebra Eng. Commun. Comput. 1995
On the Covering Radius of Long Goppa Codes,
Françoise Levy-dit-Vehel, Simon Litsyn,
AAECC 1995
On Self-Dual Affine-Invariant Codes,
Pascale Charpin, Françoise Levy-dit-Vehel,
J. Comb. Theory, Ser. A 1994