A one round protocol for tripartite Diffie–Hellman A Joux Journal of Cryptology 17 (4), 263-276, 2004 | 2125* | 2004 |

Multicollisions in iterated hash functions. Application to cascaded constructions A Joux Annual International Cryptology Conference, 306-316, 2004 | 686 | 2004 |

Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases JC Faugere, A Joux Annual International Cryptology Conference, 44-60, 2003 | 592 | 2003 |

Decoding random binary linear codes in 2 n/20: how 1+ 1= 0 improves information set decoding A Becker, A Joux, A May, A Meurer Annual International Conference on the Theory and Applications of …, 2012 | 510 | 2012 |

Separating decision Diffie–Hellman from computational Diffie–Hellman in cryptographic groups A Joux, K Nguyen Journal of cryptology 16 (4), 239-247, 2003 | 491 | 2003 |

Separating decision Diffie–Hellman from computational Diffie–Hellman in cryptographic groups A Joux, K Nguyen Journal of cryptology 16 (4), 239-247, 2003 | 491 | 2003 |

Differential collisions in SHA-0 F Chabaud, A Joux Annual International Cryptology Conference, 56-71, 1998 | 475 | 1998 |

A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic R Barbulescu, P Gaudry, A Joux, E Thomé Annual International Conference on the Theory and Applications of …, 2014 | 386 | 2014 |

Improved low-density subset sum algorithms MJ Coster, A Joux, BA LaMacchia, AM Odlyzko, CP Schnorr, J Stern computational complexity 2 (2), 111-128, 1992 | 370 | 1992 |

Collisions of SHA-0 and Reduced SHA-1 E Biham, R Chen, A Joux, P Carribault, C Lemuet, W Jalby Annual International Conference on the Theory and Applications of …, 2005 | 363 | 2005 |

The Weil and Tate pairings as building blocks for public key cryptosystems A Joux International Algorithmic Number Theory Symposium, 20-32, 2002 | 331 | 2002 |

Algorithmic cryptanalysis A Joux CRC press, 2009 | 246 | 2009 |

Lattice reduction: A toolbox for the cryptanalyst A Joux, J Stern Journal of Cryptology 11 (3), 161-185, 1998 | 241 | 1998 |

Fast correlation attacks: An algorithmic point of view P Chose, A Joux, M Mitton International Conference on the Theory and Applications of Cryptographic …, 2002 | 237 | 2002 |

A new index calculus algorithm with complexity L (1/4+ o (1)) in very small characteristic A Joux Cryptology ePrint Archive, Report 2013/095, 2013. http://eprint. iacr. org, 0 | 219* | |

New generic algorithms for hard knapsacks N Howgrave-Graham, A Joux Advances in Cryptology–EUROCRYPT 2010, 235-256, 2010 | 190 | 2010 |

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method A Joux, R Lercier Mathematics of computation 72 (242), 953-967, 2003 | 170 | 2003 |

The number field sieve in the medium prime case A Joux, R Lercier, N Smart, F Vercauteren Annual International Cryptology Conference, 326-344, 2006 | 167 | 2006 |

Why textbook ElGamal and RSA encryption are insecure D Boneh, A Joux, PQ Nguyen International Conference on the Theory and Application of Cryptology and …, 2000 | 156 | 2000 |

Improved generic algorithms for hard knapsacks A Becker, JS Coron, A Joux Annual International Conference on the Theory and Applications of …, 2011 | 143 | 2011 |