| 2007 |
|---|
| 12 | EE | Daniel Augot,
Magali Bardet,
Jean-Charles Faugère:
On formulas for decoding binary cyclic codes
CoRR abs/cs/0701070: (2007) |
| 2006 |
|---|
| 11 | EE | 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 |
|---|
| 10 | EE | Daniel Augot,
Matthieu Finiasz,
Nicolas Sendrier:
A Family of Fast Syndrome Based Cryptographic Hash Functions.
Mycrypt 2005: 64-83 |
| 9 | EE | Daniel Augot,
Raghav Bhaskar,
Valérie Issarny,
Daniele Sacchetti:
An Efficient Group Key Agreement Protocol for Ad Hoc Networks.
WOWMOM 2005: 576-580 |
| 2003 |
|---|
| 8 | EE | Daniel Augot,
Matthieu Finiasz:
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem.
EUROCRYPT 2003: 229-240 |
| 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 | EE | 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- (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 |
