Daniel Augot's publications: Research reports
- Daniel Augot, Pascale Charpin, and Nicolas Sendrier.
Studying the locator polynomials of minimum weight codewords of BCH
codes.
Technical Report 1488, INRIA, July 1991.
http://hal.inria.fr/inria-00075074/fr/.
- Daniel Augot and Paul Camion.
The minimal polynomials, characteristic subspaces, normal bases and
the Frobenius from.
Technical Report 2006, INRIA, 1993.
http://hal.inria.fr/inria-00074666/fr/.
- Daniel Augot and Caroline Fontaine.
D5.4: IPR protection for multimedia assets, 1997.
- Daniel Augot and Lancelot Pecquet.
An alternative to factorization: a speedup for Sudan’s decoding
algorithm and its generalization to algebraic-geometric codes.
Technical Report 3532, INRIA, Octobre 1998.
http://hal.inria.fr/inria-00073153/fr/.
- Daniel Augot, Magali Bardet, and Jean-Charles Faugère.
Efficient decoding of (binary) cyclic codes beyond the correction
capacity of the code using Gröbner bases.
Technical Report 4652, INRIA, Novembre 2002.
http://hal.inria.fr/inria-00071933/fr.
- Daniel Augot, Matthieu Finiasz, and Pierre Loidreau.
Using the trace operator to repair the polynomial reconstruction
based cryptosystem, presented at eurocrypt 2003.
Technical Report 209, 2003.
http://eprint.iacr.org/2003/209.
Local copy: http://eprint.iacr.org/.
- Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.
A fast provably secure cryptographic hash function.
Technical Report 230, IACR, 2003.
http://eprint.iacr.org/2003/230.
- A. Canteaut (Ed.), D. Augot, A. Biryukov, A. Braeken, C. Cid, H. Dobbertin,
H. Englund, H. Gilbert, L. Granboulan, H. Handschuh, M. Hell, T. Johansson,
A. Maximov, M. Parker, T. Pornin, B. Preneel, M. Robshaw, and M. Ward.
Open research areas in symmetric cryptography and technical trends in
lightweight cryptography.
Technical report, Réseau d’excellence européen ECRYPT, 2005.
http://www.ecrypt.eu.org/documents/D.STVL.3-2.5.pdf.
- Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.
A family of fast syndrome based cryptographic hash functions.
Technical Report 5592, INRIA, Juin 2005.
http://hal.inria.fr/inria-00070414/fr/.
- Raghav Bhaskar, Paul Mühlethaler, Daniel Augot, Cédric Adjih, and Saadi
Boudjit.
Efficient and dynamic group key agreement in Ad Hoc networks.
Technical Report RR-5915, INRIA, 2006.
http://hal.inria.fr/inria-00071348.
- Daniel Augot, François Morain, Caroline Fontaine, Jean Leneutre, Stéphane
Maag, Anna Cavalli, and Farid Naït Abdesselam.
Review of vulnerabilities in mobile ad-hoc networks: trust and
routing protocols views.
Technical report, ACI SERAC, 2005.
Internal delivrable de l’action concertée incitative SERAC.
- Anne Canteaut (ed.), D. Augot, C. Cid, H. Englund, H. Gilbert, M. Hell,
T. Johansson, M. Parker, T. Pornin, B. Preneel, and M. Robshaw.
Ongoing research areas in symmetric cryptography.
Technical Report D.STVL.5, Réseau d’excellence européen ECRYPT,
Mars 2007.
http://www.ecrypt.eu.org/documents/D.STVL.5-1.1.pdf.
- A. Canteaut (ed.), D. Augot, C. Cid, H. Gilbert, M. Hell, T. Johansson,
M. Parker, T. Pornin, B. Preneel, C. Rechberger, and M. Robshaw.
Ongoing research areas in symmetric cryptography.
Technical Report D.STVL.9, Réseau d’excellence européen ECRYPT,
July 2008.
http://www.ecrypt.eu.org/documents/D.STVL.9.pdf.
- C. Cid (ed.), M. Albrecht, D. Augot, A. Canteaut, and R.-P. Weinmann.
Algebraic cryptanalysis of symmetric primitives.
Technical Report D.STVL.7, Réseau d’excellence européen ECRYPT,
2008.
http://www.ecrypt.eu.org/documents/D.STVL.7.pdf.
Dernière modification : 03.11.2008