The kth prime is greater than k(ln k + ln ln k - 1) for k >= 2. - Pierre Dusart (Math. Comput., 1999)

Estimates of theta(x; k, l) for large values of x. - Pierre Dusart (Math. Comput., 2002)

Differential Fault Analysis on A.E.S. - Pierre Dusart; Gilles Letourneux; Olivier Vivolo (IACR Cryptol. ePrint Arch., 2003)

Counting primes in residue classes. - Marc Deléglise; Pierre Dusart; Xavier-François Roblot (Math. Comput., 2004)

Which Trust Can Be Expected of the Common Criteria Certification at End-User Level? - Damien Sauveron; Pierre Dusart (FGCN (2), 2007)

Lightweight Authentication Protocol for Low-Cost RFID Tags. - Pierre Dusart; Sinaly Traoré (WISTP, 2013)

A Set of Efficient Privacy Protection Enforcing Lightweight Authentication Protocols for Low-Cost RFID Tags. - Pierre-François Bonnefoi; Pierre Dusart; Damien Sauveron; Raja Naeem Akram; Konstantinos Markantonakis (TrustCom/BigDataSE/ISPA (1), 2015)

Estimates of ψ,θ for large values of x without the Riemann hypothesis. - Pierre Dusart (Math. Comput., 2016)