 |
 |
 |
|
|
||
|---|---|---|
| hal-00670004v2
Journal articles
On Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2013, 59 (9), pp.5882-5897. ⟨10.1109/TIT.2013.2264797⟩ |
||
| hal-01615218v1
Conference papers
Retrieving Dates in Smart Card Dumps is as Hard as Finding a Needle in a Haystack The IEEE Workshop on Information Forensics and Security (WIFS), Dec 2017, Rennes, France |
||
| hal-01338109v2
Conference papers
Memory Carving in Embedded Devices: Separate the Wheat from the Chaff 14th International Conference on Applied Cryptography and Network Security (ACNS 2016), Jun 2016, Guilford, United Kingdom. ⟨10.1007/978-3-319-39555-5_32⟩ |
||
| hal-00768566v1
Conference papers
On the decoding of quasi-BCH codes WCC - International Workshop on Coding and Cryptography, Apr 2013, Bergen, Norway |
||
| hal-01615205v1
Conference papers
Memory carving can finally unveil your embedded personal data Proceedings of the 12th International Conference on Availability, Reliability and Security (ARES), Aug 2017, Reggio di calabria, Italy |
||
| hal-00639551v1
Conference papers
Ensuring message embedding in wet paper steganography IMACC 2011, Dec 2011, Oxford, United Kingdom. pp.244-258, ⟨10.1007/978-3-642-25516-8_15⟩ |
||
| inria-00615276v2
Journal articles
On Quasi-Cyclic Codes as a Generalization of Cyclic Codes Finite Fields and Their Applications, Elsevier, 2012, 18 (5), pp.904-919. ⟨10.1016/j.ffa.2012.06.003⟩ |
||
| inria-00534726v1
Conference papers
New Set of Codes for the Maximum-Likelihood Decoding Problem Yet Another Conference on Cryptography, Oct 2010, Porquerolle, France |
||
| inria-00547106v1
Reports
List-decoding of binary Goppa codes up to the binary Johnson bound [Research Report] RR-7490, INRIA. 2010, pp.23 |
||
| hal-00643794v1
Conference papers
List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩ |
||
| inria-00584877v1
Journal articles
Wet paper codes and the dual distance in steganography Advances in Mathematics of Communications, AIMS, 2011, Lecture Notes on Computer Sciences, 6 (3), pp.273-285. ⟨10.3934/amc.2012.6.273⟩ |
||
| pastel-00677421v1
Theses
Décodage en liste et application à la sécurité de l'information Cryptographie et sécurité [cs.CR]. Ecole Polytechnique X, 2011. Français |
||
| inria-00565343v2
Conference papers
Key Reduction of McEliece's Cryptosystem Using List Decoding International Symposium of Information Theory (ISIT), Aug 2011, Saint-Peterburg, Russia. pp.2657-2661 |
||
|
|
||
