The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicolas Sendrier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier
    How to Achieve a McEliece-Based Digital Signature Scheme. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:157-174 [Conf]
  2. Anne Canteaut, Nicolas Sendrier
    Cryptoanalysis of the Original McEliece Cryptosystem. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1998, pp:187-199 [Conf]
  3. Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier
    On Correlation-Immune Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:86-100 [Conf]
  4. Daniel Augot, Pascale Charpin, Nicolas Sendrier
    The minimum distance of some binary codes via the Newton's identities. [Citation Graph (0, 0)][DBLP]
    EUROCODE, 1990, pp:65-73 [Conf]
  5. Nicolas Sendrier
    Product codes and the Singleton bound. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:304-315 [Conf]
  6. Nicolas Sendrier
    Efficient Generation of Binary Words of Given Weight. [Citation Graph (0, 0)][DBLP]
    IMA Conf., 1995, pp:184-187 [Conf]
  7. Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
    A Family of Fast Syndrome Based Cryptographic Hash Functions. [Citation Graph (0, 0)][DBLP]
    Mycrypt, 2005, pp:64-83 [Conf]
  8. Nicolas Sendrier
    On the Concatenated Structure of a Linear Code. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1998, v:9, n:3, pp:221-242 [Journal]
  9. Nicolas Sendrier
    Linear codes with complementary duals meet the Gilbert-Varshamov bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:345-347 [Journal]
  10. Nicolas Sendrier
    On the Dimension of the Hull. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:282-293 [Journal]
  11. Daniel Augot, Pascale Charpin, Nicolas Sendrier
    Studying the locator polynomials of minimum weight codewords of BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:960-973 [Journal]
  12. Daniel Augot, Nicolas Sendrier
    Idempotents and the BCH bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:204-0 [Journal]
  13. Pierre Loidreau, Nicolas Sendrier
    Weak keys in the McEliece public-key cryptosystem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:1207-1211 [Journal]
  14. Nicolas Sendrier
    Finding the permutation between equivalent linear codes: The support splitting algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1193-1203 [Journal]
  15. André Seznec, Nicolas Sendrier
    HAVEGE: A user-level software heuristic for generating empirically strong random numbers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 2003, v:13, n:4, pp:334-346 [Journal]
  16. Hervé Chabanne, Nicolas Sendrier
    On the concatenated structures of a [49, 18, 12] binary abelian code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:245-248 [Journal]

  17. Security Bounds for the Design of Code-Based Cryptosystems. [Citation Graph (, )][DBLP]


  18. McEliece Cryptosystem Implementation: Theory and Practice. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002