Bibliography

Major publications by the team in recent years

1A. Couvreur.

Codes and the Cartier Operator, 2012, To appear in Proc. Amer. Math. Soc..

http://hal.inria.fr/hal-00710451
2J.-C. Faugère, F. Levy-dit-Vehel, L. Perret.

Cryptanalysis of MinRank, in: Advances in Cryptology – CRYPTO 2008, D. Wagner (editor), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2008, vol. 5157, pp. 280-296.

http://dx.doi.org/10.1007/978-3-540-85174-5_16
3F. Morain.

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm, in: Math. Comp., 2007, vol. 76, pp. 493–505.
4B. Smith.

Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves, in: J. of Cryptology, 2009, vol. 22, n^o 4, pp. 505-529.
5A. Zeh, C. Gentner, D. Augot.

An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations, in: IEEE Trans. Inform. Theory, September 2011, vol. 57, pp. 5946-5959.

http://hal.inria.fr/hal-00645738

Publications of the year

Doctoral Dissertations and Habilitation Theses

6A. Zeh.

Algebraic Soft- and Hard-Decision Decoding of Generalized Reed–Solomon and Cyclic Codes, Ecole Polytechnique X, September 2013.

http://hal.inria.fr/pastel-00866134

Articles in International Peer-Reviewed Journals

7J. Berthomieu, G. Lecerf, G. Quintin.

Polynomial root finding over local rings and application to error correcting codes, in: Applicable Algebra in Engineering, Communication and Computing, December 2013, vol. 24, n^o 6, pp. 413-443. [ DOI : 10.1007/s00200-013-0200-5 ]

http://hal.inria.fr/hal-00642075
8G. Quintin, M. Barbier, C. Chabot.

On Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings, in: IEEE Transactions on Information Theory, September 2013, vol. 59, n^o 9, pp. 5882-5897. [ DOI : 10.1109/TIT.2013.2264797 ]

http://hal.inria.fr/hal-00670004
9B. Smith.

Families of fast elliptic curves from Q-curves, in: Lecture notes in computer science, December 2013, vol. 8269, pp. 61-78. [ DOI : 10.1007/978-3-642-42033-7_4 ]

http://hal.inria.fr/hal-00825287

International Conferences with Proceedings

10D. Augot, M. Finiasz.

Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions, in: International Symposium on Information Theory (ISIT), Istambul, Turkey, A. Lapidoth, I. Sason, J. Sayir, E. Telatar (editors), IEEE, 2013.

http://hal.inria.fr/hal-00823082
11D. Augot, P. Loidreau, G. Robert.

Rank metric and Gabidulin codes in characteristic zero, in: ISIT 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, A. Lapidoth, I. Sason, J. Sayir, E. Telatar (editors), July 2013.

http://hal.inria.fr/hal-00823535
12S. Ballet, J. Chaumine, J. Pieltant.

Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field, in: Conference on Algebraic Informatics, Porquerolles Island, France, T. Muntean, D. Poulakis, R. Rolland (editors), Lecture notes in computer science / Theoretical Computer Science and General Issues, Springer-Verlag Berlin Heidelberg, 2013, vol. 8080, pp. 160-172. [ DOI : 10.1007/978-3-642-40663-8_16 ]

http://hal.inria.fr/hal-00828070
13A. Couvreur, P. Gaborit, V. Gautier, A. Otmani, J.-P. Tillich.

Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes, in: WCC 2013 - International Workshop on Coding and Cryptography, Bergen, Norway, Selmer Center at the University of Bergen, Norway and Inria, Rocquencourt, France, 2013, pp. 181-193.

http://hal.inria.fr/hal-00830594
14J. S. R. Nielsen, A. Zeh.

Multi-Trial Guruswami–Sudan Decoding for Generalised Reed–Solomon Codes, in: International Workshop on Coding and Cryptography (WCC), Bergen, Norway, April 2013.

http://hal.inria.fr/hal-00781310
15A. Zeh, A. Wachter-Zeh, M. Gadouleau, S. Bezzateev.

Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes, in: IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, A. Lapidoth, I. Sason, J. Sayir, E. Telatar (editors), IEEE, June 2013, pp. 1-6, accepted for ISIT2013.

http://hal.inria.fr/hal-00828083

Books or Proceedings Editing

16D. Augot, A. Canteaut, G. Kyureghyan, F. Solov'Eva, Ø. Ytrehus (editors)

Designs, Codes and Cryptography (Special Issue in Coding and Cryptography), Springer, January 2013, vol. 66, 399 p.

http://hal.inria.fr/hal-00931522

Other Publications

17C. Costello, H. Hisil, B. Smith.

Faster Compact Diffie-Hellman: Endomorphisms on the x-line, 2013, To appear in EUROCRYPT 2014.

http://hal.inria.fr/hal-00932952
18A. Couvreur, I. Márquez-Corbella, R. Pellikaan.

A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems, 2014.

http://hal.inria.fr/hal-00937476
19A. Couvreur, A. Otmani, J.-P. Tillich.

New Identities Relating Wild Goppa Codes, 2013.

http://hal.inria.fr/hal-00880994
20N. Delfosse.

Decoding color codes by projection onto surface codes, 2013.

http://hal.inria.fr/hal-00855003
21N. Delfosse.

Tradeoffs for reliable quantum information storage in surface codes and color codes, 2013.

http://hal.inria.fr/hal-00798030
22J. Pieltant, H. Randriam.

New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields, 2013.

http://hal.inria.fr/hal-00828153
23B. Smith.

Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians, October 2013.

http://hal.inria.fr/hal-00874925

References in notes

24R. J. McEliece.

A Public-Key System Based on Algebraic Coding Theory, Jet Propulsion Lab, 1978, pp. 114–116, DSN Progress Report 44.
25H. Niederreiter.

Knapsack-type cryptosystems and algebraic coding theory, in: Problems of Control and Information Theory, 1986, vol. 15, n^o 2, pp. 159–166.
26V. Sidelnikov, S. Shestakov.

On the insecurity of cryptosystems based on generalized Reed-Solomon codes, in: Discrete Math. Appl., 1992, vol. 1, n^o 4, pp. 439-444.

Previous |

Home