 | 2012 |
| 27 |  | Daniel Augot,
François Morain:
Discrete logarithm computations over finite fields using Reed-Solomon codes
CoRR abs/1202.4361: (2012) |
| 2011 |
| 26 |  | Frederik Armknecht,
Daniel Augot,
Ludovic Perret,
Ahmad-Reza Sadeghi:
On Constructing Homomorphic Encryption Schemes from Coding Theory.
IMA Int. Conf. 2011: 23-40 |
| 25 |  | Daniel Augot,
Morgan Barbier,
Caroline Fontaine:
Ensuring Message Embedding in Wet Paper Steganography.
IMA Int. Conf. 2011: 244-258 |
| 24 |  | Alexander Zeh,
Christian Gentner,
Daniel Augot:
An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations
CoRR abs/1110.3898: (2011) |
| 23 |  | Daniel Augot,
Morgan Barbier,
Caroline Fontaine:
Ensuring message embedding in wet paper steganography
CoRR abs/1111.2301: (2011) |
| 22 |  | Frederik Armknecht,
Daniel Augot,
Ludovic Perret,
Ahmad-Reza Sadeghi:
On Constructing Homomorphic Encryption Schemes from Coding Theory.
IACR Cryptology ePrint Archive 2011: 309 (2011) |
| 21 |  | Alexander Zeh,
Christian Gentner,
Daniel Augot:
An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations.
IEEE Transactions on Information Theory 57(9): 5946-5959 (2011) |
| 2010 |
| 20 |  | Daniel Augot,
Morgan Barbier,
Alain Couvreur:
List-decoding of binary Goppa codes up to the binary Johnson bound
CoRR abs/1012.3439: (2010) |
| 2009 |
| 19 |  | Daniel Augot,
Jean-Charles Faugère,
Ludovic Perret:
Foreword.
J. Symb. Comput. 44(12): 1605-1607 (2009) |
| 18 |  | Daniel Augot,
Magali Bardet,
Jean-Charles Faugère:
On the decoding of binary cyclic codes with the Newton identities.
J. Symb. Comput. 44(12): 1608-1625 (2009) |
| 2008 |
| 17 |  | Daniel Augot,
Alexander Zeh:
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm.
ISIT 2008: 2620-2624 |
| 2007 |
| 16 |  | Daniel Augot,
Magali Bardet,
Jean-Charles Faugère:
On formulas for decoding binary cyclic codes
CoRR abs/cs/0701070: (2007) |
| 15 |  | Daniel Augot,
Raghav Bhaskar,
Valérie Issarny,
Daniele Sacchetti:
A three round authenticated group key agreement protocol for ad hoc networks.
Pervasive and Mobile Computing 3(1): 36-52 (2007) |
| 2006 |
| 14 |  | Raghav Bhaskar,
Paul Mühlethaler,
Daniel Augot,
Cedric Adjih,
Saadi Boudjit,
Anis Laouiti:
Efficient and Dynamic Group Key Agreement in Ad hoc Networks
CoRR abs/cs/0611027: (2006) |
| 2005 |
| 13 |  | Daniel Augot,
Matthieu Finiasz,
Nicolas Sendrier:
A Family of Fast Syndrome Based Cryptographic Hash Functions.
Mycrypt 2005: 64-83 |
| 12 |  | Daniel Augot,
Raghav Bhaskar,
Valérie Issarny,
Daniele Sacchetti:
An Efficient Group Key Agreement Protocol for Ad Hoc Networks.
WOWMOM 2005: 576-580 |
| 2003 |
| 11 |  | Daniel Augot,
Matthieu Finiasz:
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem.
EUROCRYPT 2003: 229-240 |
| 10 |  | Daniel Augot,
Matthieu Finiasz,
Pierre Loidreau:
Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003.
IACR Cryptology ePrint Archive 2003: 209 (2003) |
| 9 |  | Daniel Augot,
Matthieu Finiasz,
Nicolas Sendrier:
A Fast Provably Secure Cryptographic Hash Function.
IACR Cryptology ePrint Archive 2003: 230 (2003) |
| 2001 |
| 8 |  | Daniel Augot,
Claude Carlet:
Preface: Volume 6.
Electronic Notes in Discrete Mathematics 6: 556-557 (2001) |
| 2000 |
| 7 |  | Daniel Augot,
Lancelot Pecquet:
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes.
IEEE Transactions on Information Theory 46(7): 2605-2614 (2000) |
| 1998 |
| 6 |  | Daniel Augot,
Jean-François Delaigle,
Caroline Fontaine:
DHWM: A Scheme for Managing Watermarking Keys in the Aquarelle Multimedia Distributed System.
ESORICS 1998: 241-255 |
| 5 |  | Daniel Augot,
Caroline Fontaine:
Key issues for watermarking digital images.
Electronic Imaging 1998: 176-185 |
| 1996 |
| 4 |  | Daniel Augot,
Françoise Levy-dit-Vehel:
Bounds on the minimum distance of the duals of BCH codes.
IEEE Transactions on Information Theory 42(4): 1257-1260 (1996) |
| 1994 |
| 3 |  | Daniel Augot,
Nicolas Sendrier:
Idempotents and the BCH bound.
IEEE Transactions on Information Theory 40(1): 204-207 (1994) |
| 1992 |
| 2 |  | Daniel Augot,
Pascale Charpin,
Nicolas Sendrier:
Studying the locator polynomials of minimum weight codewords of BCH codes.
IEEE Transactions on Information Theory 38(3): 960-973 (1992) |
| 1990 |
| 1 |  | Daniel Augot,
Pascale Charpin,
Nicolas Sendrier:
The minimum distance of some binary codes via the Newton's identities.
EUROCODE 1990: 65-73 |