Daniel Augot's publications: Peer reviewed conference articles
Home Page

Journal articles Peer reviewed conference articles Peer reviewed conference proceedings Technical reports

  1. Daniel Augot, Pascale Charpin, and Nicolas Sendrier. The minimum distance of some binary codes via the Newton’s identities. In Gérard Cohen and Pascale Charpin, editors, Eurocode 90 (Udine, 1990), volume 514, pages 65–73, Berlin, 1990. Springer-Verlag. http://www.springerlink.com/content/y70u036378333833/?p=24652831e84f407fa144dfefca40b2b7pi=7. Local copy: EUROCODES_90.pdf.
  2. Daniel Augot. A deterministic algorithm for computing a normal basis in a finite field. In Eurocodes 94, Abbaye de la Bussière, France France, 1994. Local copy: Eurocodes94.pdf.
  3. Daniel Augot and Caroline Fontaine. Key issues for watermarking digital images. In SPIE, EUROPTO - Conference on Electronic Imaging: Processing, Printing, and Publishing in Color, EUROPTO, pages 176–185, Zürich, Suisse, 1998. Local copy: Europto98.pdf.
  4. Daniel Augot, Jean-Francois Delaigle, and Caroline Fontaine. A scheme for managing watermarking keys in the Aquarelle multimedia distributed system. In Jean-Jacques Quisquater, Yves Deswarte, Catherine Meadows, and Dieter Gollmann, editors, ESORICS, number 1485 in Lecture Notes in Computer Science. Springer-Verlag, 1998. http://www.springerlink.com/content/ly3d0qe0upe1w55d/?p=169e7f4d62924176b12dd76210d3708cpi=0. Local copy: ESORICS98.pdf.
  5. Daniel Augot and Matthieu Finiasz. A public key encryption scheme based on the polynomial reconstruction problem. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT 2003, number 2656 in Lecture Notes in Computer Science, pages 229–240. Springer-Verlag, 2003. http://www.springerlink.de/content/k61v1wgre681gky9/?p=5db976762edb4bdda9d9f01021011a7cpi=13. Local copy: EUROCRYPT2003.pdf.
  6. Raghav Bhaskar, Daniel Augot, Valérie Issarny, and Daniele Sacchetti. An efficient group key agreement protocol for ad hoc networks. In WOWMOM ’05. IEEE Workshop on Trust, Security and Privacy in Ubiquitous Computing, Taormina, Italy, 2005. http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=31043arnumber=1443570. Local copy: tspuc05.pdf.
  7. Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier. A family of fast syndrome based cryptographic hash functions. In Ed Dawson and Serge Vaudenay, editors, Progress in Cryptology - MyCrypt 2005: First International Conference on Cryptology in Malaysia, number 3715 in Lecture Notes in Computer Science, pages 64–83. Springer-Verlag, 2005. http://www.springerlink.com/content/1jl5wkw58a89uq4b/?p=68741f25475d4d3286a15720369a8051pi=5. Local copy: mycrypt05.pdf.
  8. Daniel Augot, Mostafa El-Khamy, Robert J McEliece, Farzad Parvaresh, Mikhail Stepanov, and Alexander Vardy. List decoding of Reed-Solomon product codes. In Proceedings of the Tenth International Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod, Russia, pages 210–213, September 2006. ACCT-X.pdf. Local copy: ACCT-X.pdf.
  9. Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On formulas for decoding binary cyclic codes. In IEEE Internation Symposium on Information Theory (ISIT 2007), Nice, France, 2007. decode_cyclique.pdf. Local copy: decode_cyclique.pdf.
  10. Daniel Augot and Alexander Zeh. On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm. In Information Theory, 2008. ISIT 2008. IEEE International Symposium on, pages 2620–2624, 2008.
Dernière modification : 03.11.2008