The SCEAS System
Navigation Menu

Search the dblp DataBase


Christophe De Cannière: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christophe De Cannière, Christian Rechberger
    Finding SHA-1 Characteristics: General Results and Applications. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2006, pp:1-20 [Conf]
  2. Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz
    Cryptanalysis of SAFER++. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:195-211 [Conf]
  3. Alex Biryukov, Christophe De Cannière, Michaël Quisquater
    On Multiple Linear Approximations. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:1-22 [Conf]
  4. Alex Biryukov, Christophe De Cannière, An Braeken, Bart Preneel
    A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:33-50 [Conf]
  5. Steve Babbage, Christophe De Cannière, Joseph Lano, Bart Preneel, Joos Vandewalle
    Cryptanalysis of SOBER-t32. [Citation Graph (0, 0)][DBLP]
    FSE, 2003, pp:111-128 [Conf]
  6. Alex Biryukov, Christophe De Cannière
    Block Ciphers and Systems of Quadratic Equations. [Citation Graph (0, 0)][DBLP]
    FSE, 2003, pp:274-289 [Conf]
  7. Christophe De Cannière
    Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles. [Citation Graph (0, 0)][DBLP]
    ISC, 2006, pp:171-186 [Conf]
  8. Dai Watanabe, Alex Biryukov, Christophe De Cannière
    A Distinguishing Attack of SNOW 2.0 with Linear Masking Method. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2003, pp:222-233 [Conf]
  9. Hirotaka Yoshida, Alex Biryukov, Christophe De Cannière, Joseph Lano, Bart Preneel
    Non-randomness of the Full 4 and 5-Pass HAVAL. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:324-336 [Conf]

  10. KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers. [Citation Graph (, )][DBLP]

  11. Preimages for Reduced SHA-0 and SHA-1. [Citation Graph (, )][DBLP]

  12. Collisions for 70-Step SHA-1: On the Full Cost of Collision Search. [Citation Graph (, )][DBLP]

  13. Finding Collisions for a 45-Step Simplified HAS-V. [Citation Graph (, )][DBLP]

  14. Analysis of Grain's Initialization Algorithm. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002