The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jacques Patarin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jacques Patarin
    Generic Attacks on Feistel Schemes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:222-238 [Conf]
  2. Jacques Patarin
    Collisions and Inversions for Damgård's Whole Hash Function. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1994, pp:307-321 [Conf]
  3. Jacques Patarin, Louis Goubin, Nicolas Courtois
    C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1998, pp:35-49 [Conf]
  4. Jacques Patarin, Valérie Nachef, Côme Berbain
    Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2006, pp:396-411 [Conf]
  5. Jacques Patarin
    Improved Security Bounds for Pseudorandom Permutations. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1997, pp:142-150 [Conf]
  6. Louis Goubin, Jacques Patarin
    DES and Differential Power Analysis (The "Duplication" Method). [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:158-172 [Conf]
  7. Jacques Patarin
    Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:513-529 [Conf]
  8. Jacques Patarin
    Security of Random Feistel Schemes with 5 or More Rounds. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:106-122 [Conf]
  9. Jacques Patarin
    New Results on Pseudorandom Permutation Generators Based on the DES Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1991, pp:301-312 [Conf]
  10. Jacques Patarin
    Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:248-261 [Conf]
  11. Jacques Patarin
    Asymmetric Cryptography with a Hidden Monomial. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1996, pp:45-60 [Conf]
  12. Jacques Patarin, Pascal Chauvaud
    Improved Algorithms for the Permuted Kernel Problem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:391-402 [Conf]
  13. Nicolas Courtois, Jacques Patarin
    About the XL Algorithm over GF(2). [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2003, pp:141-157 [Conf]
  14. Jacques Patarin, Nicolas Courtois, Louis Goubin
    QUARTZ, 128-Bit Long Digital Signatures. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2001, pp:282-297 [Conf]
  15. Jacques Patarin, Nicolas Courtois, Louis Goubin
    FLASH, a Fast Multivariate Signature Algorithm. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2001, pp:298-307 [Conf]
  16. Jacques Patarin
    Pseudorandom permutations based on the DES scheme. [Citation Graph (0, 0)][DBLP]
    EUROCODE, 1990, pp:193-204 [Conf]
  17. Côme Berbain, Henri Gilbert, Jacques Patarin
    QUAD: A Practical Stream Cipher with Provable Security. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:109-128 [Conf]
  18. Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter
    Low-Exponent RSA with Related Messages. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:1-9 [Conf]
  19. Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir
    Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:392-407 [Conf]
  20. Paul Camion, Jacques Patarin
    The Knapsack Hash Function proposed at Crypto'89 can be broken. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:39-53 [Conf]
  21. Aviad Kipnis, Jacques Patarin, Louis Goubin
    Unbalanced Oil and Vinegar Signature Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:206-222 [Conf]
  22. Jacques Patarin
    How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:256-266 [Conf]
  23. Jacques Patarin
    How to Find and Avoid Collisions for the Knapsack Hash Function. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1993, pp:305-317 [Conf]
  24. Jacques Patarin
    Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1996, pp:33-48 [Conf]
  25. Jacques Patarin, Louis Goubin, Nicolas Courtois
    Improved Algorithms for Isomorphisms of Polynomials. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:184-200 [Conf]
  26. Jacques Patarin
    About Feistel Schemes with Six (or More) Rounds. [Citation Graph (0, 0)][DBLP]
    Fast Software Encryption, 1998, pp:103-121 [Conf]
  27. Jacques Patarin, Louis Goubin
    Trapdoor one-way permutations and multivariate polynominals. [Citation Graph (0, 0)][DBLP]
    ICICS, 1997, pp:356-368 [Conf]
  28. Jacques Patarin, Louis Goubin
    Asymmetric cryptography with S-Boxes. [Citation Graph (0, 0)][DBLP]
    ICICS, 1997, pp:369-380 [Conf]
  29. Jacques Patarin
    On Linear Systems of Equations with Distinct Variables and Small Block Size. [Citation Graph (0, 0)][DBLP]
    ICISC, 2005, pp:299-321 [Conf]
  30. Jacques Patarin, Audrey Montreuil
    Benes and Butterfly Schemes Revisited. [Citation Graph (0, 0)][DBLP]
    ICISC, 2005, pp:92-116 [Conf]
  31. Audrey Montreuil, Jacques Patarin
    The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2004, pp:33-47 [Conf]
  32. Aline Gouget, Jacques Patarin
    Probabilistic Multivariate Cryptography. [Citation Graph (0, 0)][DBLP]
    VIETCRYPT, 2006, pp:1-18 [Conf]
  33. Jacques Patarin
    Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:20, n:2, pp:175-209 [Journal]
  34. Jacques Patarin, Valérie Nachef, Côme Berbain
    Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:325-341 [Conf]

  35. The Random Oracle Model and the Ideal Cipher Model Are Equivalent. [Citation Graph (, )][DBLP]


  36. QUAD: Overview and Recent Developments. [Citation Graph (, )][DBLP]


  37. Pseudorandom Permutations Based on the D.E.S. Scheme. [Citation Graph (, )][DBLP]


  38. The "Coefficients H" Technique. [Citation Graph (, )][DBLP]


  39. Building Secure Block Ciphers on Generic Attacks Assumptions. [Citation Graph (, )][DBLP]


  40. A Proof of Security in O(2n) for the Benes Scheme. [Citation Graph (, )][DBLP]


  41. Generic Attacks on Feistel Networks with Internal Permutations. [Citation Graph (, )][DBLP]


  42. A Proof of Security in O(2n) for the Xor of Two Random Permutations. [Citation Graph (, )][DBLP]


  43. Generic Attacks on Misty Schemes. [Citation Graph (, )][DBLP]


  44. t-resilient functions and the partial exposure problem. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.041secs
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